Abstract
Let $G$ be an Eulerian bipartite digraph with vertex partition sizes $m,n$. We prove the following Turán-type result: If $e(G) > 2mn/3$ then $G$ contains a directed cycle of length at most 4. The result is sharp. We also show that if $e(G)=2mn/3$ and no directed cycle of length at most 4 exists, then $G$ must be biregular. We apply this result in order to obtain an improved upper bound for the diameter of interchange graphs.
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.