The dichromatic Mader bound for oriented cycles
The dichromatic Mader bound for oriented cycles
Let be an oriented cycle, and let be the dichromatic number of a digraph . Dichromatic-cycle conjecture. Every oriented cycle satisfies . The surrounding text gives a weaker established bound for oriented cycles, so this stronger inequality is presented as an open conjecture.
Sources & referencesView supporting material
Primary source
Pierre Aboulker, Nathann Cohen, Fréderic Havet, William Lochet, Phablo F. S. Moura and Stéphan Thomassé, “Subdivisions in digraphs of large out-degree or large dichromatic number”, arXiv:1610.00876 (2016).
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
Sign in to submit a solution.
No solutions have been posted yet.