The monochromatic cycle interval conjecture for dense 2-colored graphs
Statement
Let be a graph of order , with vertex set and edge set . A -coloring of is a partition
where and are spanning subgraphs of . Write or when the red or blue graph contains a cycle of length .
Monochromatic cycle interval conjecture. If and , then every -coloring of has, for every , either a red -cycle or a blue -cycle:
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.