Two disjoint cycles in digraphs

Mikołaj Lewandowski, Joanna Polcyn, Christian Reiher

Bermond and Thomassen conjectured that every digraph with minimum outdegree at least $2k-1$ contains $k$ vertex disjoint cycles. So far the conjecture was verified for $k\le 3$. He…