Indecomposable 1-factorizations of the complete multigraph K₂n for every 2n

Abstract: A

1

-factorization of the complete multigraph

l a m b d a K_{2 n}

is said to be indecomposable if it cannot be represented as the union of

1

-factorizations of

l a m b d a_{0} K_{2 n}

and

(l a m b d a - l a m b d a_{0}) K_{2 n}

, where

l a m b d a_{0} < l a m b d a

. It is said to be simple if no

1

-factor is repeated. For every

n g e q 9

and for every

(n - 2) / 3 l e q l a m b d a l e q 2 n

, we construct an indecomposable

1

-factorization of

l a m b d a K_{2 n}

which is not simple. These

1

-factorizations provide simple and indecomposable

1

-factorizations of

l a m b d a K_{2 s}

for every

s g e q 18

and

2 l e q l a m b d a l e q 2 l f l o o r s / 2 f l o o r - 1

. We also give a generalization of a result by Colbourn et al. which provides a simple and indecomposable

1

-factorization of

l a m b d a K_{2 n}

, where

2 n = p^{m} + 1

,

l a m b d a = (p^{m} - 1) / 2

,

p

prime.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Indecomposable 1-factorizations of the complete multigraph \(\lambda K_{2n}\) for every \(\lambda \leq 2n\)