Partitioning digraphs with outdegree at least 4

Guanwu Liu, Xingxing Yu

Scott asked the question of determining $c_d$ such that if $D$ is a digraph with $m$ arcs and minimum outdegree $d\ge 2$ then $V(D)$ has a partition $V_1,V_2$ such that $\min\left…