The circular altitude conjecture for the third Mycielskian of K6K_6

Let K6K_6 be the complete graph on six vertices, and let M3(K6)\mathcal M^3(K_6) denote its third Mycielskian. Write α(G)\alpha^\circ(G) for the circular altitude of a graph GG and χc(G)\chi_c(G) for its circular chromatic number. The preceding bounds give

8α(M3(K6))χc(M3(K6))9.8\leqslant \alpha^\circ(\mathcal M^3(K_6))\leqslant \chi_c(\mathcal M^3(K_6))\leqslant 9.

Circular altitude conjecture.

α(M3(K6))=9\alpha^\circ(\mathcal M^3(K_6))=9

and hence

χc(M3(K6))=9.\chi_c(\mathcal M^3(K_6))=9.

The circular chromatic number of M3(K6)\mathcal M^3(K_6) is a prominent open problem in circular colouring. The conjecture is based on trial computer computations and would determine both the circular altitude and circular chromatic number in this case.

Sources & referencesView supporting material

Primary source

John Bamberg, Brian Corr, Alice Devillers, Daniel Hawtin, Irene Pivotto and Eric Swartz, “The circular altitude of a graph”, arXiv:1608.06127 (2016).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.