Erdős Problem #751 — Gaps Between Cycle Lengths in Four-Chromatic Graphs
Statement
Let be a graph with chromatic number , and let be the set of its cycle lengths. Can the gaps between distinct cycle lengths be arbitrarily large; that is, is it true that for every there exist a type and a graph on such that and, for all , Can this also happen while imposing an arbitrarily large girth; that is, is it true that for every there exist and with , girth, and ?
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.