ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an nn-vertex graph, and write δ(G)\delta(G) for its minimum degree. A Hamiltonian cycle is a cycle spanning all vertices of GG. The bounded-defect cycle conjecture. If δ(G)≥3\delta(G)\geq 3 and GG contains a Hamiltonian cycle, then GG contains another cycle of length at least

n−K,n-K,

where K>0K>0 is an absolute constant. The conjecture asks whether the error term in the paper's asymptotic result can be bounded independently of nn; the source notes that even K=2K=2 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 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.