Mathematics – Combinatorics
Scientific paper
2009-08-24
Mathematics
Combinatorics
38 pages, 2 figures. Added section sketching how we can extend our main result. To appear in the Proceedings of the LMS
Scientific paper
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.
Kühn Daniela
Osthus Deryk
Treglown Andrew
No associations
LandOfFree
Hamilton decompositions of regular tournaments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Hamilton decompositions of regular tournaments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamilton decompositions of regular tournaments will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-698329