ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an nn-vertex graph, and let e(G)e(G) denote its number of edges. Say that GG contains kk cycles of consecutive even lengths when it contains such a collection of cycles. Verstraëte's conjecture. If GG is an nn-vertex graph not containing kk cycles of consecutive even lengths, then

e(G)≤12(2k+1)(n−1),e(G) \leq \frac{1}{2}(2k+1)(n-1),

with equality if and only if every block of GG is a clique of order 2k+12k+1. The conjecture generalizes extremal results on the existence of consecutive even cycle lengths; its cases k=1k=1 and k=2k=2 are known, while the general statement remains open.

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.