On the Hamilton-Waterloo problem with odd orders

Abstract: Given non-negative integers

, the Hamilton-Waterloo problem asks for a factorization of the complete graph

K_{v}

into

a l p h a

C_{m}

-factors and

C_{n}

-factors. Clearly,

v

odd,

n, m g e q 3

,

m m i d v

,

n m i d v

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

m

and

n

the necessary conditions are sufficient when

v

is a multiple of

m n

and

v > m n

, except possibly when

or 3, with five additional possible exceptions in

. For the case where

v = m n

we show sufficiency when

except possibly when

(m, a l p h a) = (3, 2)

,

(3, 4)

, with seven further possible exceptions in

. We also show that when

n g e q m g e q 3

are odd integers, the lexicographic product of

C_{m}

with the empty graph of order

n

has a factorization into

a l p h a

C_{m}

-factors and

C_{n}

-factors for every

0 l e q a l p h a l e q n

,

, except possibly when

a l p h a = 2, 4

,

, with three additional possible exceptions in

(m, n, a l p h a)

.

Recommendations

Cited in

(19)

This page was built for publication: On the Hamilton-Waterloo problem with odd orders