Block colourings of star systems

Abstract: An

e

-star system of order

n

is a decomposition of the complete graph

K_{n}

into copies of the complete bipartite graph

K_{1, e}

(or

e

-star). Such systems are known to exist if and only if

n g e q 2 e

and

e

divides

. We consider block colourings of such systems, where each

e

-star is assigned a colour, and two

e

-stars which share a vertex receive different colours. We present a computer analysis of block colourings of small

3

-star systems. Furthermore, we prove that: (i) for

n e q u i v 0, 1

mod

2 e

there exists either an

n

or

(n - 1)

-block colourable

e

-star system of order

n

; and (ii) when

e = 3

, the same result holds in the remaining congruence classes mod

6

.

Recommendations

Cites work

Cited in

(1)

This page was built for publication: Block colourings of star systems