Lichiardopol's conjecture on disjoint cycles in tournaments

Autor:	Ma, Fuhong, West, Douglas B., Yan, Jin
Rok vydání:	2017
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1707.02384 Zobrazit plný text záznamu View this record from Arxiv