Projects per year
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 | |
Publication status | Published - 1 Jul 2010 |
Fingerprint
Dive into the research topics of 'Hamilton decompositions of regular tournaments'. Together they form a unique fingerprint.Projects
- 1 Finished
-
Directed graphs and the regularity method
Engineering & Physical Science Research Council
1/10/07 → 31/03/11
Project: Research Councils