The Directed Uniform Hamilton-Waterloo Problem Involving Even Cycle Sizes

Authors Fatih Yetgin, Uğur Odabaşı, Sibel Özkan

Publication date 21 June 2023

Graph designs and isomorphic decomposition (05C51) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: In this paper, factorizations of the complete symmetric digraph

K_{v}^{*}

into uniform factors consisting of directed even cycle factors are studied as a generalization of the undirected Hamilton-Waterloo Problem. It is shown, with a few possible exceptions, that

K_{v}^{*}

can be factorized into two nonisomorphic factors, where these factors are uniform factors of

K_{v}^{*}

involving

K_{2}^{*}

or directed

m

-cycles, and directed

m

-cycles or

2 m

-cycles for even

m

.

This page was built for publication: The Directed Uniform Hamilton-Waterloo Problem Involving Even Cycle Sizes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6440981)