Jackson's Hamilton decomposition conjecture for regular bipartite tournaments

A regular bipartite tournament is an orientation of the complete balanced bipartite graph $K_{2n,2n}$ in which every vertex has indegree and outdegree $n$. A Hamilton decomposition is a decomposition of all directed edges into Hamilton cycles. Jackson's conjecture. Any regular bipartite tournament can be decomposed into Hamilton cycles. Jackson's conjecture concerns the existence of a spanning cycle decomposition in the most balanced bipartite tournament setting. Jackson proved that every regular bipartite tournament is Hamiltonian; the decomposition assertion is the remaining conjectural strengthening addressed by this paper.