Document Type

Article

Publication Date

11-25-2019

Department

Department of Mathematical Sciences

Abstract

The Hamilton-Waterloo problem asks for a decomposition of the complete graph of order v into r copies of a 2-factor F1 and s copies of a 2-factor F2 such that r+s = v−1 2 . If F1 consists of m-cycles and F2 consists of n cycles, we say that a solution to (m, n)- HWP(v; r, s) exists. The goal is to find a decomposition for every possible pair (r, s). In this paper, we show that for odd x and y, there is a solution to (2kx, y)-HWP(vm; r, s) if gcd(x, y) ≥ 3, m ≥ 3, and both x and y divide v, except possibly when 1 ∈ {r, s}.

Publisher's Statement

© This work is licensed under https://creativecommons.org/licenses/by/4.0/. Publisher’s version of record: https://doi.org/10.26493/1855-3974.1610.03d

Publication Title

ARS MATHEMATICA CONTEMPORANEA

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

Version

Publisher's PDF

Included in

Mathematics Commons

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.