ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For k≥2k\geq 2, let χk\chi_k be the largest chromatic number of a graph that does not contain kk cycles of consecutive lengths. Sudakov–Verstraëte's conjecture. For every integer k≥2k\geq 2, χk=k+1\chi_k=k+1. The lower bound χk≥k+1\chi_k\geq k+1 follows from the complete graph Kk+1K_{k+1}; the paper gives no resolution status for the asserted equality in the supplied text.

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.