On the minimum number of arcs in $k$-dicritical oriented graphs

Pierre Aboulker, Thomas Bellitto, Frédéric Havet +1

The dichromatic number $\dic(D)$ of a digraph $D$ is the least integer $k$ such that $D$ can be partitioned into $k$ directed acyclic digraphs. A digraph is $k$-dicritical if $\dic…