Abstract
The Gallai–Milgram theorem states that every directed graph D is spanned by α(D) disjoint directed paths, where α(D) is the size of a largest stable set of D. When α(D)>1 and D is strongly connected, it has been conjectured by Las Vergnas that D is spanned by an arborescence with α(D)−1 leaves. The case α=2 follows from a result of C. C. Chen and P. Manalastas (1983, Discrete Math.44, 243–250). We give a proof of this conjecture in the general case.
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 callDisclaimer: 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.
