ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices with a red-blue coloring of its edges. A partition into cycles is a collection of vertex-disjoint monochromatic cycles spanning V(G)V(G).

Balogh–Barát–Gerbner–Gyárfás–Sárközy conjecture. If

δ(G)>3n4,\delta(G)>\frac{3n}{4},

then GG 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 δ(G)>(3/4+o(1))n\delta(G)>(3/4+o(1))n, 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 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.