On the Directed Oberwolfach Problem with Equal Cycle Lengths

Andrea Burgess; Mateja Šajna

doi:10.37236/2982

Andrea Burgess
Mateja Šajna

Keywords: Directed Oberwolfach Problem, complete symmetric digraph, resolvable directed cycle decomposition, Mendelsohn design

Abstract

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$.