ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices, and let CC be a positive constant. A cycle with linearly many chords is a cycle on [200 ℓ[200~\ell vertices having at least [201 ℓ/2[201~\ell/2 chords.

Cycle-with-chords conjecture. If GG has average degree at least Clog⁡log⁡(n)C\log\log(n), then GG contains a cycle CC on [202 ℓ[202~\ell vertices with at least [203 ℓ/2[203~\ell/2 chords, for some [204 ℓ⩾4[204~\ell\geqslant 4.

The surrounding discussion presents this as a conjectural strengthening of the paper's results on cycles with almost linearly many chords; it also suggests that the regular-graph case may be a natural first step. The source gives no evidence that the conjecture has been resolved.

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.