The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order (Q5960788): Difference between revisions

The directed anti-Oberwolfach problem asks whether there exists a 2-factorization of the complete directed graph \(K_n\) with the property that for each admissible cycle size \(k\) (i.e. \(k\in \{2,3,\dots, n-2,n\}\)), a directed cycle of length \(k\) is contained in some directed 2-factor. In this paper, the problem is completely solved for odd \(n\). The techniques used are those of \textit{W. L. Piotrowski} [The solution of the bipartite analogue of the Oberwolfach problem, Discrete Math. 97, 339-356 (1991; Zbl 0765.05080)] and of the present author in [The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs, Lect. Notes Comput. Sci. 1776, 115-122 (2000; Zbl 0970.05033)].