Balogh–Barát–Gerbner–Gyárfás–Sárközy cycle-partition conjecture
Statement
Let be a graph on vertices with a red-blue coloring of its edges. A partition into cycles is a collection of vertex-disjoint monochromatic cycles spanning .
Balogh–Barát–Gerbner–Gyárfás–Sárközy conjecture. If
then has a partition into a red cycle and a blue cycle.
This is the minimum-degree analogue of Lehel's conjecture for complete graphs. The paper proves the result under the asymptotically weaker condition , while the exact threshold stated here remains open in the source.
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.