ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph of order nn, with vertex set V(G)V(G) and edge set E(G)E(G). A 22-coloring of GG is a partition

E(G)=E(R)∪E(B),E(G)=E(R)\cup E(B),

where RR and BB are spanning subgraphs of GG. Write Ck⊂RC_k\subset R or Ck⊂BC_k\subset B when the red or blue graph contains a cycle of length kk.

Monochromatic cycle interval conjecture. If n≥4n\geq4 and δ(G)>3n/4\delta(G)>3n/4, then every 22-coloring of E(G)E(G) has, for every k∈[4,⌈n/2⌉]k\in[4,\lceil n/2\rceil], either a red kk-cycle or a blue kk-cycle:

Ck⊂R or Ck⊂Bfor all k∈[4,⌈n/2⌉].C_k\subset R\text{ or }C_k\subset B\quad\text{for all }k\in[4,\lceil n/2\rceil].

This proposes a Ramsey--Turán strengthening of results for complete graphs and very dense graphs: a minimum-degree condition should force monochromatic cycles of every length in a whole interval, rather than merely one cycle length. The source gives no resolution status for the conjecture.

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.