Disjoint Directed Cycles

It is shown that there exists a positiveεso that for any integerk, every directed graph with minimum outdegree at leastkcontains at leastεkvertex disjoint cycles. On the other hand, for everykthere is a digraph with minimum outdegreekwhich does not contain two vertex or edge disjoint cycles of the same length.