Hamilton decompositions of regular tournaments

Daniela Kuhn; Deryk Osthus; Andrew Treglown

doi:10.1112/plms/pdp062

Hamilton decompositions of regular tournaments

Mathematics

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

13 Citations (Scopus)

Abstract

We show that every sufficiently large regular tournament can almost completely be decomposed into edge-disjoint Hamilton cycles. More precisely, for each eta > 0 every regular tournament G of sufficiently large order n contains at least (1/2-eta)n edge-disjoint Hamilton cycles. This gives an approximate solution to a conjecture of Kelly from 1968. Our result also extends to almost regular tournaments.

Original language	English
Pages (from-to)	303-335
Number of pages	33
Journal	London Mathematical Society. Proceedings
Volume	101
DOIs	https://doi.org/10.1112/plms/pdp062
Publication status	Published - 1 Jul 2010

Access to Document

10.1112/plms/pdp062

Directed graphs and the regularity method
Kuhn, D. (Principal Investigator) & Osthus, D. (Co-Investigator)
Engineering & Physical Science Research Council
1/10/07 → 31/03/11
Project: Research Councils

Cite this

@article{b364445c20174d97a38c2b5c924051de,

title = "Hamilton decompositions of regular tournaments",

abstract = "We show that every sufficiently large regular tournament can almost completely be decomposed into edge-disjoint Hamilton cycles. More precisely, for each eta > 0 every regular tournament G of sufficiently large order n contains at least (1/2-eta)n edge-disjoint Hamilton cycles. This gives an approximate solution to a conjecture of Kelly from 1968. Our result also extends to almost regular tournaments.",

author = "Daniela Kuhn and Deryk Osthus and Andrew Treglown",

year = "2010",

month = jul,

day = "1",

doi = "10.1112/plms/pdp062",

language = "English",

volume = "101",

pages = "303--335",

journal = "London Mathematical Society. Proceedings ",

issn = "1460-244X",

publisher = "London Mathematical Society",

}

TY - JOUR

T1 - Hamilton decompositions of regular tournaments

AU - Kuhn, Daniela

AU - Osthus, Deryk

AU - Treglown, Andrew

PY - 2010/7/1

Y1 - 2010/7/1

N2 - We show that every sufficiently large regular tournament can almost completely be decomposed into edge-disjoint Hamilton cycles. More precisely, for each eta > 0 every regular tournament G of sufficiently large order n contains at least (1/2-eta)n edge-disjoint Hamilton cycles. This gives an approximate solution to a conjecture of Kelly from 1968. Our result also extends to almost regular tournaments.

AB - We show that every sufficiently large regular tournament can almost completely be decomposed into edge-disjoint Hamilton cycles. More precisely, for each eta > 0 every regular tournament G of sufficiently large order n contains at least (1/2-eta)n edge-disjoint Hamilton cycles. This gives an approximate solution to a conjecture of Kelly from 1968. Our result also extends to almost regular tournaments.

U2 - 10.1112/plms/pdp062

DO - 10.1112/plms/pdp062

M3 - Article

SN - 1460-244X

VL - 101

SP - 303

EP - 335

JO - London Mathematical Society. Proceedings

JF - London Mathematical Society. Proceedings

ER -

Hamilton decompositions of regular tournaments

Abstract

Access to Document

Fingerprint

Projects

Directed graphs and the regularity method

Cite this