Partitioning digraphs with outdegree at least 4
Guanwu Liu, Xingxing Yu · Journal of Graph Theory · 2021
Abstract Scott asked the question of determining such that if is a digraph with arcs and minimum outdegree then has a partition such that , where (respectively, ) is the number of arcs from to (respectively, from to ). Lee, Loh, and Sudakov showed that and , and conjectured that for . In this paper, we show and prove some partial results for .