Conjecture on the maximum dichromatic number of oriented triangle-free graphs
For each positive integer , let be the maximum dichromatic number of an oriented triangle-free graph of order . Maximum dichromatic number conjecture.
This conjecture is implied by the conjectured asymptotic order of the minimum acyclic number and would determine the maximum dichromatic number up to constant factors.
References
- Pierre Aboulker, Frédéric Havet, François Pirot and Juliette Schabanel, “Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order”, arXiv:2403.02298 (2024).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.