Bipartitions of highly connected tournaments
Research output: Contribution to journal › Article › peer-review
Colleges, School and Institutes
We show that if T is a strongly 109k6log (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.
|Number of pages||6|
|Journal||Electronic Notes in Discrete Mathematics|
|Publication status||Published - 1 Nov 2015|