pith. sign in

arxiv: 0908.3411 · v2 · pith:2ZBJ2OQKnew · submitted 2009-08-24 · 🧮 math.CO

Hamilton decompositions of regular tournaments

classification 🧮 math.CO
keywords regularhamiltonalmostcyclesedge-disjointeverylargesufficiently
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.