Hamilton decompositions of regular tournaments

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)303-335
Number of pages33
JournalLondon Mathematical Society. Proceedings
Volume101
DOIs
Publication statusPublished - 1 Jul 2010

Fingerprint

Dive into the research topics of 'Hamilton decompositions of regular tournaments'. Together they form a unique fingerprint.

Cite this