On the directed Oberwolfach Problem with equal cycle lengths: the odd case
Combinatorics
2017-06-22 v1
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 , .
Cite
@article{arxiv.1706.06625,
title = {On the directed Oberwolfach Problem with equal cycle lengths: the odd case},
author = {Andrea Burgess and Nevena Francetic and Mateja Sajna},
journal= {arXiv preprint arXiv:1706.06625},
year = {2017}
}