The circular altitude conjecture for the third Mycielskian of K_6
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.