Sudakov–Verstraëte's extremal block conjecture for consecutive even cycles
Statement
Let be a graph with the maximum possible number of edges among graphs that do not contain cycles of consecutive even lengths. A block is a maximal connected subgraph with no cut vertex. Sudakov–Verstraëte's conjecture. Every block of is a clique of order at most . This is presented as a strengthening related to Thomassen's conjecture; the source proves the case , 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.