2022/10/31 by António Girão, Girão, António, Shoham Letzter +1
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Optimization and Search Problems
paper · pdf · doi:10.48550/arxiv.2210.17371
openalex publication_date 2022/10/31 · openalex created_date 2022/11/06 · openalex updated_date 2026/07/28
We prove that there exists a constant c > 0 such that the vertices of every strongly c ⋅ kt-connected tournament can be partitioned into t parts, each of which induces a strongly k-connected tournament. This is clearly tight up to a constant factor, and it confirms a conjecture of Kühn, Osthus and Townsend (2016).