Abstract
AbstractScott 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 .
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call