Triangle decompositions of K_v - K_w - K_u

Abstract: Denote by

l a m b d a K_{v}

the complete graph of order

v

with multiplicity

l a m b d a

. Let

l a m b d a K_{v} - l a m b d a K_{w} - l a m b d a K_{u}

be the graph obtained from

l a m b d a K_{v}

by the removal of the edges of two vertex disjoint complete multi-subgraphs with multiplicity

l a m b d a

of orders

w

and

u

, respectively. When

l a m b d a

is odd, it is shown that there exists a triangle decomposition of

l a m b d a K_{v} - l a m b d a K_{w} - l a m b d a K_{u}

if and only if

v g e q w + u + m a x u, w

,

l a m b d a l e f t (v c h o o s e 2 - u c h o o s e 2 - w c h o o s e 2 i g h t) e q u i v 0 p m o d 3

and

l a m b d a (v - w) e q u i v l a m b d a (v - u) e q u i v l a m b d a (v - 1) e q u i v 0 p m o d 2

. When

l a m b d a

is even, it is shown that for large enough

v

, the elementary necessary conditions for the existence of a triangle decomposition of

l a m b d a K_{v} - l a m b d a K_{w} - l a m b d a K_{u}

are also sufficient.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Triangle decompositions of \(\lambda K_v - \lambda K_w - \lambda K_u\)