Verstraëte's conjecture on consecutive even cycles
Statement
Let be an -vertex graph, and let denote its number of edges. Say that contains cycles of consecutive even lengths when it contains such a collection of cycles. Verstraëte's conjecture. If is an -vertex graph not containing cycles of consecutive even lengths, then
with equality if and only if every block of is a clique of order . The conjecture generalizes extremal results on the existence of consecutive even cycle lengths; its cases and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.