Harvey's minimum-degree conjecture on chords of longest cycles
Statement
Let be a graph on vertices, let denote its minimum degree, and let a cycle of maximum order mean a cycle containing the maximum possible number of vertices in . Harvey's conjecture. If
then every cycle of maximum order in contains a chord.
The source attributes this conjecture to Harvey and does not state a resolution. The paper proves related results under large-circumference hypotheses, but the stated minimum-degree conjecture remains open on the supplied evidence.
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.