Near-Hamiltonian cycle conjecture for minimal triangle-free k-chromatic graphs
Statement
Let be a -chromatic triangle-free graph, and let be the minimum number of vertices in a -chromatic triangle-free graph. Near-Hamiltonian cycle conjecture. The graph contains a cycle of length at least
This conjecture predicts that every -chromatic triangle-free graph has a cycle covering all but a sublinear number of the vertices of a smallest -chromatic triangle-free graph. The authors present it as a belief in the concluding remarks; no resolution is given 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.