Self-orthogonal Hamilton path decompositions (Q1183991)

Let \(2K_ n\) denote the complete multigraph on \(n\) vertices in which each edge has multiplicity 2. The authors consider the following problem: For which values of \(n\) can the edges of \(2K_ n\) be partitioned into Hamilton paths so that any two paths have exactly one edge in common? A decomposition with the above property is called a self-orthogonal Hamilton path decomposition. The main result of the paper is: Theorem: Let \(m\geq 5\) be a prime power and let \(n\geq 3\). Suppose there exist self-orthogonal Hamilton path decompositions of \(2K_ m\) and \(2K_ n\). Furthermore, suppose that the edges of \(2K_ m\) can be 2- coloured (say, red and blue) so that the edges in each of the Hamilton paths in the decomposition are alternatively coloured red and blue. Then there exists a self-orthogonal path decomposition of \(2K_{nm}\).