Can I read Partitioning a Tournament Into Sub-tournaments of High Connectivity on EtoBox?

Partitioning a Tournament Into Sub-tournaments of High Connectivity by Girão, António; Letzter, Shoham is a scholarly article available to read on EtoBox.

What is Partitioning a Tournament Into Sub-tournaments of High Connectivity about?

We prove that there exists a constant $c > 0$ such that the vertices of every strongly $c \cdot 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).

Author

Girão, António; Letzter, Shoham

Published

2022

Language

EN