$\chi$-bounded families of oriented graphs

Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet +4

A famous conjecture of Gyárfás and Sumner states for any tree $T$ and integer $k$, if the chromatic number of a graph is large enough, either the graph contains a clique of size $k…