ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be an mm-colored semicomplete rr-partite digraph with r≥2r\geq 2. A directed cycle is monochromatic if all of its arcs have the same color, and a 11-colored kernel is a kernel whose relevant reachability and independence conditions use at most one color. The monochromatic-cycle conjecture. If every C→3\overrightarrow{C}_{3} and C→4\overrightarrow{C}_{4} contained in DD is monochromatic, then DD has a 11-colored kernel. The conjecture would generalize the cited theorem for mm-colored rr-partite tournaments; its status is not resolved in the supplied text.

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.