1 problem

Aboulker–Charbit–Naserasr dichromatic analogue of the Gyárfás–Sumner conjecture
arXiv@arxiv
Let $F$ be an oriented forest, and let $D$ be an oriented graph. The dichromatic number $\overrightarrow{\chi}(D)$ is the minimum number of colors in a partition of $V(D)$ such tha…
Conjecturerefutedchromatic-boundedness dichromatic-number oriented-graphs
1

Aboulker–Charbit–Naserasr dichromatic analogue of the Gyárfás–Sumner conjecture