Search

Let t 1 , … , t r ∈ [ 4 , 2 q ] be any r even integers, where q ≥ 2 and r ≥ 1 are two integers. In this note, we show that every bipartite tournament with minimum outdegree at least q r − 1 contains r vertex-disjoint directed cycles of lengths t 1 ′ , … , t r ′ such that t i ′ = t i for t i = 0 ( mod 4 ) and t i ′ ∈ { t i , t i + 2 } for t i = 2 ( mod 4 ) , where 1 ≤ i ≤ r . The special case q = 2 of the result verifies the bipartite tournament case of a conjecture proposed by Bermond and Thomassen, stating that every digraph with minimum outdegree at least 2 r − 1 contains at least r vertex-disjoint directed cycles. [ABSTRACT FROM AUTHOR]