On the Directed Oberwolfach Problem with Equal Cycle Lengths

Andrea Burgess, Mateja Šajna


We examine the necessary and sufficient conditions for a complete symmetric digraph $K_n^\ast$ to admit a resolvable decomposition into directed cycles of length $m$. We give a complete solution for even $m$, and a partial solution for odd $m$.


Directed Oberwolfach Problem; complete symmetric digraph; resolvable directed cycle decomposition; Mendelsohn design

Full Text: