Abstract
AbstractWe prove that every digraph of independence number at most 2 and arc‐connectivity at least 2 has an out‐branching and an in‐branching which are arc‐disjoint (we call such branchings a good pair). This is best possible in terms of the arc‐connectivity as there are infinitely many strong digraphs with independence number 2 and arbitrarily high minimum in‐ and out‐degrees that have no good pair. The result settles a conjecture by Thomassen for digraphs of independence number 2. We prove that every digraph on at most 6 vertices and arc‐connectivity at least 2 has a good pair and give an example of a 2‐arc‐strong digraph on 10 vertices with independence number 4 that has no good pair. We also show that there are infinitely many digraphs with independence number 7 and arc‐connectivity 2 that have no good pair. Finally we pose a number of open problems.
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.
