The monochromatic triangle-and-quadrilateral conjecture for semicomplete multipartite digraphs
Statement
Let be an -colored semicomplete -partite digraph with . A directed cycle is monochromatic if all of its arcs have the same color, and a -colored kernel is a kernel whose relevant reachability and independence conditions use at most one color. The monochromatic-cycle conjecture. If every and contained in is monochromatic, then has a -colored kernel. The conjecture would generalize the cited theorem for -colored -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.