ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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