English

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 KnK_n^{*} admits a (C2,...,C2,C3)( \vec{C}_2, ..., \vec{C}_2, \vec{C}_3) -factorization for all n1,3, n\equiv 1, 3, or 7(mod8) 7\pmod{8}. We also show that KnK_n^{*} admits a (C2,Cn2)(\vec{C}_2, \vec{C}_{n-2})-factorization for any integer n5n \geq 5.

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

R2 v1 2026-06-23T18:38:09.614Z