ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices, let δ(G)\delta(G) denote its minimum degree, and let a cycle of maximum order mean a cycle containing the maximum possible number of vertices in GG. Harvey's conjecture. If

δ(G)≥n,\delta(G)\geq \sqrt{n},

then every cycle of maximum order in GG 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 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.