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 .
Sign-in/Register to access full text options 
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 callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
