Two disjoint cycles in digraphs
Abstract
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 3. Here we generalise the question asking for all outdegree sequences which force k vertex disjoint cycles and give the full answer for k 2.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.