Bipartitions of highly connected tournaments

2014/11/06 by Kim, Jaehoon, Kühn, Daniela, Osthus, Deryk
#05C20 #05C40 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1411.1533

Abstract

We show that if T is a strongly 10⁹k⁶log(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

• Partitioning a tournament into sub-tournaments of high connectivity
• Decomposition of balanced multipartite tournaments into strongly\n connected tournaments
• Solution on strong partition of 2-balanced regular multipartite tournaments
• Highly linked tournaments with large minimum out-degree
• Highly linked tournaments