Kelly's conjecture on Hamiltonian decompositions of regular tournaments

A regular tournament is a tournament in which every vertex has the same indegree and outdegree. Kelly's conjecture. Every regular tournament on $n=2k+1$ vertices has a decomposition into $k$ arc-disjoint Hamiltonian cycles. The conjecture was proved for large $n$ by Kühn and Osthus; the source does not state a complete resolution for all $n$.