Disjoint cycles in digraphs

We show that, for each natural numberk, these exists a (smallest) natural numberf(k) such that any digraph of minimum outdegree at leastf(k) containsk disjoint cycles. We conjecture thatf(k)=2k−1 and verify this fork=2 and we show that, for eachk≧3, the determination off(k) is a finite problem.

[1]  Carsten Thomassen.  Girth in graphs , 1983, J. Comb. Theory, Ser. B.

[2]  Jean-Claude Bermond,et al.  Cycles in digraphs- a survey , 1981, J. Graph Theory.

[3]  Andras Hajnal,et al.  On the maximal number of independent circuits in a graph , 1963 .

[4]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[5]  P. Erdos,et al.  On the maximal number of independent circuits in a graph , 1963 .

[6]  P. Erdös,et al.  On Independent Circuits Contained in a Graph , 1965, Canadian Journal of Mathematics.