Back to Search
Start Over
Lichiardopol's conjecture on disjoint cycles in tournaments
- Publication Year :
- 2017
-
Abstract
- In 2010, N. Lichiardopol conjectured for $q \geq 3$ and $k \geq 1$ that any tournament with minimum out-degree at least $(q-1)k-1$ contains $k$ disjoint cycles of length $q$. We prove this conjecture for $q \geq 5$. Since it is already known to hold for $q\le4$, this completes the proof of the conjecture.
- Subjects :
- Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1707.02384
- Document Type :
- Working Paper