ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with chromatic number χ(G)=4\chi(G)=4, and let G.cycleLengthsG.\mathrm{cycleLengths} 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 k∈Nk\in\mathbb N there exist a type VV and a graph GG on VV such that χ(G)=4\chi(G)=4 and, for all m,m′∈G.cycleLengthsm,m'\in G.\mathrm{cycleLengths}, m<m′  ⟹  m+k≤m′?m<m'\implies m+k\leq m'? Can this also happen while imposing an arbitrarily large girth; that is, is it true that for every k,g∈Nk,g\in\mathbb N there exist VV and GG with χ(G)=4\chi(G)=4, girth(G)≥g(G)\geq g, and ∀m,m′∈G.cycleLengths,m<m′  ⟹  m+k≤m′\forall m,m'\in G.\mathrm{cycleLengths},\quad m<m'\implies m+k\leq m'?

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.