Two disjoint cycles in digraphs

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$. Here we generalise the question asking for all outdegree sequences which force $k$ vertex disjoint cycles and give the full answer for $k\le 2$.

No reviews yet.

No comments yet.