Abstract
Let D be a bipartite digraph and let T be an oriented tree of order k. We consider two conditions of the minimum indegree and the minimum outdegree of a digraph D guaranteeing that D contains T. The bounds depend on k and the conditions are sharp. We also include some remarks on the same problem for an arbitrary digraph (not necessarily bipartite).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.