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 -factorization of the complete symmetric digraph where there are two non-isomorphic -factors. In the uniform version of the problem, factors consist of either directed -cycles or -cycles. In this paper, necessary conditions for a solution of this problem are given, and the problem is solved for the factors with ,.
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}
}