科研之友
微信
新浪微博
Facebook
分享链接
摘要
We prove that every tournament with minimum out-degree at least 2k-1 contains k disjoint 3-cycles. This provides additional support for the conjecture by Bermond and Thomassen that every digraph D of minimum out-degree 2k-1 contains k vertex disjoint cycles. We also prove that for every epsilon>0, when k is large enough, every tournament with minimum out-degree at least (1.5+epsilon)k contains k disjoint cycles. The linear factor 1.5 is best possible as shown by the regular tournaments.
- 出版日期2014-3
- 单位INRIA
