Bipartitions of highly connected tournaments

Jaehoon Kim; Daniela Kühn; Deryk Osthus

doi:10.1016/j.endm.2015.06.013

Bipartitions of highly connected tournaments

Jaehoon Kim, Daniela Kühn, Deryk Osthus

Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We show that if T is a strongly 10⁹k⁶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.

Original language	English
Pages (from-to)	79-84
Number of pages	6
Journal	Electronic Notes in Discrete Mathematics
Volume	49
DOIs	https://doi.org/10.1016/j.endm.2015.06.013
Publication status	Published - 1 Nov 2015

Keywords

Connectivity
Partition
Tournament

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.endm.2015.06.013

Cite this

@article{17f67756f9d54b3186129769881d3f54,

title = "Bipartitions of highly connected tournaments",

abstract = "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.",

keywords = "Connectivity, Partition, Tournament",

author = "Jaehoon Kim and Daniela K{\"u}hn and Deryk Osthus",

year = "2015",

month = nov,

day = "1",

doi = "10.1016/j.endm.2015.06.013",

language = "English",

volume = "49",

pages = "79--84",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

}

TY - JOUR

T1 - Bipartitions of highly connected tournaments

AU - Kim, Jaehoon

AU - Kühn, Daniela

AU - Osthus, Deryk

PY - 2015/11/1

Y1 - 2015/11/1

N2 - 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.

AB - 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.

KW - Connectivity

KW - Partition

KW - Tournament

UR - http://www.scopus.com/inward/record.url?scp=84947795078&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2015.06.013

DO - 10.1016/j.endm.2015.06.013

M3 - Article

AN - SCOPUS:84947795078

SN - 1571-0653

VL - 49

SP - 79

EP - 84

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -

Bipartitions of highly connected tournaments

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this