| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651883 | Electronic Notes in Discrete Mathematics | 2015 | 6 Pages |
Abstract
We show that if T is a strongly 109k6log(2k)-connected tournament, there exists a partition A, B of V(T) such that each of T[A], T[B] and T[A,B] is strongly k-connected. This provides tournament analogues of two partition conjectures of Thomassen regarding highly connected graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
