On the directed Oberwolfach Problem with equal cycle lengths: the odd case
arXiv:1706.06625
Abstract
We show that the complete symmetric digraph admits a resolvable decomposition into directed cycles of length for all odd , . Consequently, admits a resolvable decomposition into directed cycles of length for all and odd , .