ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a kk-chromatic triangle-free graph, and let nkn_k be the minimum number of vertices in a kk-chromatic triangle-free graph. Near-Hamiltonian cycle conjecture. The graph GG contains a cycle of length at least

nk−o(nk).n_k-o(n_k).

This conjecture predicts that every kk-chromatic triangle-free graph has a cycle covering all but a sublinear number of the vertices of a smallest kk-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.