Partitioning a tournament into sub-tournaments of high connectivity
Abstract
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\"uhn, Osthus and Townsend (2016).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.