English

On the Directed Hamilton-Waterloo Problem with Two Cycle Sizes

Combinatorics 2022-10-06 v1

Abstract

The Directed Hamilton-Waterloo Problem asks for a directed 22-factorization of the complete symmetric digraph KvK_v^* where there are two non-isomorphic 22-factors. In the uniform version of the problem, factors consist of either directed mm-cycles or nn-cycles. In this paper, necessary conditions for a solution of this problem are given, and the problem is solved for the factors with (m,n){(4,6),(4,8),(4,12),(4,16),(6,12)(m, n)\in \{(4,6),(4,8),(4,12),(4,16),(6,12),(8,16),(3,5),(3,15),(5,15)}(8,16),(3,5),(3,15),(5,15)\}.

Cite

@article{arxiv.2209.14588,
  title  = {On the Directed Hamilton-Waterloo Problem with Two Cycle Sizes},
  author = {Fatih Yetgin and Uğur Odabaşı and Sibel Özkan},
  journal= {arXiv preprint arXiv:2209.14588},
  year   = {2022}
}
R2 v1 2026-06-28T02:20:54.171Z