On the Directed Oberwolfach Problem with variable cycle lengths
Combinatorics
2020-09-21 v1
Abstract
The Directed Oberwolfach Problem can be considered as the directed version of the well-known Oberwolfach Problem, first mentioned by Ringel at a conference in Oberwolfach, Germany in 1967. In this paper, we describe some new partial results on the Directed Oberwolfach Problem with variable cycle lengths. In particular, we show that the complete symmetric digraph admits a -factorization for all or . We also show that admits a -factorization for any integer .
Cite
@article{arxiv.2009.08731,
title = {On the Directed Oberwolfach Problem with variable cycle lengths},
author = {Elaheh Shabani and Mateja Šajna},
journal= {arXiv preprint arXiv:2009.08731},
year = {2020}
}
Comments
31 pages, 7 figures