Bipartitions of highly connected tournaments

Jaehoon Kim; Daniela Kühn; Deryk Osthus

Bipartitions of highly connected tournaments

Combinatorics 2015-02-03 v3

Authors: Jaehoon Kim , Daniela Kühn , Deryk Osthus

Abstract

We show that if $T$ is a strongly $10^9k^6\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.

Keywords

tournaments strong connectivity bipartition highly connected Thomassen conjectures

Cite

@article{arxiv.1411.1533,
  title  = {Bipartitions of highly connected tournaments},
  author = {Jaehoon Kim and Daniela Kühn and Deryk Osthus},
  journal= {arXiv preprint arXiv:1411.1533},
  year   = {2015}
}

Comments

The main result of the current version strengthens the previous one

Related papers

View all related →