On the Hamilton–Waterloo Problem with Odd Orders

Andrea C. Burgess, Peter Danziger, Tommaso Traetta

Journal of Combinatorial Designs · 2016 · 23 citations · 34 references

Concepts

Abstract

Abstract Given nonnegative integers , the Hamilton–Waterloo problem asks for a factorization of the complete graph into α ‐factors and β ‐factors. Without loss of generality, we may assume that . Clearly, v odd, , , and are necessary conditions. To date results have only been found for specific values of m and n . In this paper, we show that for any integers , these necessary conditions are sufficient when v is a multiple of and , except possibly when or 3. For the case where we show sufficiency when with some possible exceptions. We also show that when are odd integers, the lexicographic product of with the empty graph of order n has a factorization into α ‐factors and β ‐factors for every , , with some possible exceptions.

References

34