A large number of m-coloured complete infinite subgraphs

Abstract: Given an edge colouring of a graph with a set of

m

colours, we say that the graph is

m

- extit{coloured} if each of the

m

colours is used. For an

m

-colouring

D e l t a

of

m a t h b b N^{(2)}

, the complete graph on

m a t h b b N

, we denote by

m a t h c a l F_{D e l t a}

the set all values

g a m m a

for which there exists an infinite subset

X s u b s e t m a t h b b N

such that

X^{(2)}

is

g a m m a

-coloured. Properties of this set were first studied by Erickson in

1994

. Here, we are interested in estimating the minimum size of

m a t h c a l F_{D e l t a}

over all

m

-colourings

D e l t a

of

m a t h b b N^{(2)}

. Indeed, we shall prove the following result. There exists an absolute constant

a l p h a > 0

such that for any positive integer

m e q l e f t n c h o o s e 2 + 1, n c h o o s e 2 + 2 : n g e q 2 i g h t

,

| m a t h c a l F_{D e l t a} | g e q (1 + a l p h a) s q r t 2 m

, for any

m

-colouring

D e l t a

of

m a t h b b N^{(2)}

, thus proving a conjecture of Narayanan. This result is tight up to the order of the constant

a l p h a

.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: A large number of \(m\)-coloured complete infinite subgraphs