ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD 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 D∗D^{*}. Thomassé's conjecture. It is possible to choose the reversions so that the dichromatic number of D∗D^{*} 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 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.