Sudakov–Verstraëte chromatic-number conjecture for consecutive cycle lengths
Statement
For , let be the largest chromatic number of a graph that does not contain cycles of consecutive lengths. Sudakov–Verstraëte's conjecture. For every integer , . The lower bound follows from the complete graph ; the paper gives no resolution status for the asserted equality in the supplied text.
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.