Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree

arXiv1706.01699MaRDI QIDQ6287540FDOQ6287540

Authors: Maoqun Wang, Weihua Yang 

Publication date: 6 June 2017

Abstract: The Bermond-Thomassen conjecture states that, for any positive integer $r$, a digraph of minimum out-degree at least $2r-1$ contains at least $r$ vertex-disjoint directed cycles. In 2014, Bang-Jensen, Bessy and Thomass' e proved the conjecture for tournaments. In 2010, Lichiardopol conjectured that a tournament $T$ with minimum out-degree at least $(q-1)r-1$ contains at least $r$ vertex-disjoint $q$-cycles, where integer $qgeq3$ and $rgeq1$. In this paper, we address Lichiardopol's conjecture affirmatively. In particular, the case $q=3$ implies Bermond-Thomassen conjecture for tournaments.

This page was built for publication: Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6287540)