Thomassé's cycle-reversion conjecture for dichromatic number
Statement
Let be a potentially infinite digraph. A cycle reversion reverses the edges of a directed cycle; iteratively perform such reversions, requiring that each edge is reversed only finitely many times, and denote the resulting reorientation by . Thomassé's conjecture. It is possible to choose the reversions so that the dichromatic number of is at most two. The conjecture concerns reducing the dichromatic number of arbitrary finite or infinite digraphs through controlled cycle reversions, and its status is open.
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.