Skip to main content
Article thumbnail
Location of Repository

Disjoint 3-cycles in tournaments . . .

By Jørgen Bang-Jensen, Stéphane Bessy and Stéphan Thomassé


We prove that every tournament with minimum out-degree at least 2k − 1 contains k disjoint 3-cycles. This provides additional support for the conjecture by Bermond and Thomassen that every digraph D of minimum out-degree 2k − 1 contains k vertex disjoint cycles. We also prove that for every ɛ> 0, when k is large enough, every tournament with minimum out-degree at least (1.5 + ɛ)k contains k disjoint cycles. The linear factor 1.5 is best possible as shown by the regular tournaments

Topics: Disjoint cycles, tournaments
Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.