On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform-length cycles
Combinatorics
2023-03-09 v1
Abstract
We examine the necessary and sufficient conditions for a complete symmetric equipartite digraph with parts of size to admit a resolvable decomposition into directed cycles of length . We show that the obvious necessary conditions are sufficient for in each of the following four cases: (i) is even; (ii) ; (iii) and or ; and (iv) , and if , then for a prime .
Keywords
Cite
@article{arxiv.2303.04308,
title = {On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform-length cycles},
author = {Nevena Francetić and Mateja Šajna},
journal= {arXiv preprint arXiv:2303.04308},
year = {2023}
}