Koh–Rogers–Lee–Toh conjecture on graceful variable windmills

From papers

Let CnC_n be a cycle of length n3n\geq 3, and let CntC_n^t be the graph obtained from the union of tt copies of CnC_n with one vertex in common, called the central vertex. A graph is graceful if it has an injective vertex labelling with labels in {0,1,,m}\{0,1,\ldots,m\}, where mm is the number of edges, such that the induced edge labels are exactly {1,2,,m}\{1,2,\ldots,m\}. Koh–Rogers–Lee–Toh conjecture. The graph CntC_n^t is graceful if and only if

nt0,3(mod4).nt\equiv 0,3\pmod 4.

This conjecture characterizes exactly which variable windmills are expected to admit graceful labellings; the supplied text gives no resolution or partial status, so it remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Ahmad H. Alkasasbeh, Danny Dyer and Jared Howell, “Graceful labellings of variable windmills using Skolem sequences”, arXiv:2112.04265 (2021).

Solutions 0

No solutions have been posted yet.