Conjecture on consecutive cycle lengths in 3-connected graphs
Statement
Let be an integer, and let be a -connected non-bipartite graph with minimum degree at least .
Conjecture on consecutive cycle lengths. Except when is , the graph contains cycles of consecutive lengths.
The paper proves this statement for and notes that its proof also handles some special cases for or . The conjecture asks whether the condition can be relaxed to .
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.