The dichromatic Mader bound for oriented cycles

About 10 years old · traced to

Let CC be an oriented cycle, and let χ⃗(D)\vec\chi(D) be the dichromatic number of a digraph DD. Dichromatic-cycle conjecture. Every oriented cycle CC satisfies mader⁡χ⃗(C)≤∣C∣\operatorname{mader}_{\vec\chi}(C)\leq |C|. The surrounding text gives a weaker established bound for oriented cycles, so this stronger inequality is presented as an open conjecture.

References

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

No solutions have been posted yet.