ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥4k\ge 4 be an integer, and let GG be a 33-connected non-bipartite graph with minimum degree at least kk.

Conjecture on consecutive cycle lengths. Except when GG is Kk+1K_{k+1}, the graph GG contains kk cycles of consecutive lengths.

The paper proves this statement for k≥6k\ge 6 and notes that its proof also handles some special cases for k=4k=4 or k=5k=5. The conjecture asks whether the condition k≥6k\ge 6 can be relaxed to k≥4k\ge 4.

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.