zbMATH — the first resource for mathematics

Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments. (English) Zbl 1292.05119
Summary: 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 \(\epsilon >0 \), when \(k\) is large enough, every tournament with minimum out-degree at least \((1.5 + \epsilon)k\) contains \(k\) disjoint cycles. The linear factor 1.5 is best possible as shown by the regular tournaments.

05C20 Directed graphs (digraphs), tournaments
05C38 Paths and cycles
Full Text: DOI
[1] Alon, Disjoint directed cycles, J Combin Theory Ser B 68 (2) pp 167– (1996) · Zbl 0861.05037 · doi:10.1006/jctb.1996.0062
[2] Alon, The Probabilistic Method (2000) · doi:10.1002/0471722154
[3] Bang-Jensen, Digraphs: Theory, Algorithms and Applications (2009) · Zbl 1170.05002 · doi:10.1007/978-1-84800-998-1
[4] Bermond, Cycles in digraphs-a survey, J Graph Theory 5 (1) pp 1– (1981) · Zbl 0458.05035 · doi:10.1002/jgt.3190050102
[5] Bessy, Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree, Discrete Math 310 pp 557– (2010) · Zbl 1188.05072 · doi:10.1016/j.disc.2009.03.039
[6] Lichiardopol, Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree, Discrete Math 310 pp 2567– (2010) · Zbl 1227.05157 · doi:10.1016/j.disc.2010.06.024
[7] Lichiardopol, A step towards the Bermond-Thomassen conjecture about disjoint cycles in digraphs, SIAM J Discrete Math 23 pp 979– (2009) · Zbl 1191.05054 · doi:10.1137/080715792
[8] Thomassen, Disjoint cycles in digraphs, Combinatorica 3 (3-4) pp 393– (1983) · Zbl 0527.05036 · doi:10.1007/BF02579195
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.