Abstract
AbstractThe fractional arboricity of a digraph , denoted by , is defined as . Frank proved that a digraph decomposes into branchings, if and only if and . In this paper, we study digraph analogues for the Nine Dragon Tree Conjecture. We conjecture that, for positive integers and , if is a digraph with and , then decomposes into branchings with . This conjecture, if true, is a refinement of Frank's characterization. A series of acyclic bipartite digraphs is also presented to show the bound of given in the conjecture is best possible. We prove our conjecture for the cases . As more evidence to support our conjecture, we prove that if is a digraph with the maximum average degree and , then decomposes into pseudo‐branchings with .
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.
