Abstract
AbstractA tournament is a digraph which has exactly one arc between any two vertices. Let and be two positive integers with . A ‐cycle is a cycle of length . We prove that for any real number , there exists a constant such that for every , any tournament with minimum outdegree at least contains disjoint ‐cycles. This generalizes a result by Bang‐Jensen, Bessy, and Thomassé for disjoint 3‐cycles. The linear factor of minimum outdegree is the best possible.
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.
