  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.
