The bounded-defect cycle conjecture for Hamiltonian graphs
Statement
Let be an -vertex graph, and write for its minimum degree. A Hamiltonian cycle is a cycle spanning all vertices of . The bounded-defect cycle conjecture. If and contains a Hamiltonian cycle, then contains another cycle of length at least
where is an absolute constant. The conjecture asks whether the error term in the paper's asymptotic result can be bounded independently of ; the source notes that even may be possible, while related constructions may rule out such small values.
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.