Name
Title | ||
|---|---|---|
Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. |
Abstract | ||
|---|---|---|
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. (C) 2013 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1002/jgt.21740 | JOURNAL OF GRAPH THEORY |
Keywords | Field | DocType |
disjoint cycles,tournaments | Discrete mathematics,Tournament,Combinatorics,Disjoint sets,Vertex (geometry),Conjecture,Mathematics,Digraph | Journal |
Volume | Issue | ISSN |
75.0 | 3.0 | 0364-9024 |
Citations | PageRank | References |
9 | 0.79 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jørgen Bang-Jensen | 1 | 573 | 68.96 |
| Stéphane Bessy | 2 | 117 | 19.68 |
| Stéphan Thomassé | 3 | 651 | 66.03 |