The circular altitude conjecture for the third Mycielskian of
Let be the complete graph on six vertices, and let denote its third Mycielskian. Write for the circular altitude of a graph and for its circular chromatic number. The preceding bounds give
Circular altitude conjecture.
and hence
The circular chromatic number of 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.
References
- 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.