%0 Journal Article
%T Vertex-Disjoint Subtournaments of Prescribed Minimum Outdegree or Minimum Semidegree: Proof for Tournaments of a Conjecture of Stiebi
%A Nicolas Lichiardopol
%J International Journal of Combinatorics
%D 2012
%I Hindawi Publishing Corporation
%R 10.1155/2012/273416
%X It was proved (Bessy et al., 2010) that for ¡Ý1, a tournament with minimum semidegree at least 2£¿1 contains at least r vertex-disjoint directed triangles. It was also proved (Lichiardopol, 2010) that for integers ¡Ý3 and ¡Ý1, every tournament with minimum semidegree at least (£¿1)£¿1 contains at least r vertex-disjoint directed cycles of length . None information was given on these directed cycles. In this paper, we fill a little this gap. Namely, we prove that for ¡Ý1 and ¡Ý1, every tournament of minimum outdegree at least ((2
%U http://www.hindawi.com/journals/ijct/2012/273416/