Wheel characterization of the circumference gap
Statement
Let be a finite simple graph. Its circumference is the length of a longest cycle, its induced circumference is the length of a longest induced cycle, and denotes its minimum degree. A graph is -connected if it remains connected after deletion of any one vertex, and a wheel is a graph formed from a cycle by adding a new vertex adjacent to every vertex of the cycle.
Wheel characterization conjecture. Let be a -connected graph with
Then if and only if is a wheel.
The source states that this conjecture is equivalent to the non-Hamiltonian form of Harvey's conjecture. It isolates wheels as the unique Hamiltonian graphs in the relevant class whose two cycle parameters differ by exactly one.
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.