论文标题
挖掘中的两个不交联循环
Two disjoint cycles in digraphs
论文作者
论文摘要
Bermond and Thomassen猜想，每一个具有最低超级超级至少$ 2K-1 $的挖掘物包含$ k $ tertex的分离周期。到目前为止，猜想已被验证为$ k \ le 3 $。在这里，我们概括了一个问题，要求所有迫使$ k $顶点的脱节周期的超级序列，并给出$ k \ le 2 $的完整答案。
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$.
