English

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 Kn[m]K_{n[m]}^\ast with nn parts of size mm to admit a resolvable decomposition into directed cycles of length tt. We show that the obvious necessary conditions are sufficient for m,n,t2m,n,t \ge 2 in each of the following four cases: (i) m(n1)m(n-1) is even; (ii) gcd(m,n)∉{1,3}\gcd(m,n) \not\in \{1,3\}; (iii) gcd(m,n)=1\gcd(m,n)=1 and 4n4|n or 6n6|n; and (iv) gcd(m,n)=3\gcd(m,n)=3, and if n=6n=6, then pmp|m for a prime p37p \le 37.

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}
}