论文标题
将比赛划分为高连通性的子旅程
Partitioning a tournament into sub-tournaments of high connectivity
论文作者
论文摘要
我们证明存在一个恒定的$ c> 0 $，因此每个强烈的$ c \ cdot kt $连接的锦标赛的顶点可以分为$ t $零件，每个零件都可以诱导强烈的$ k $连接的锦标赛。显然，这是一个不变的因素，它证实了库恩，奥斯图斯和汤森（2016）的猜想。
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ühn, Osthus and Townsend (2016).
