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.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics