A note on unavoidable patterns in locally dense colourings

Abstract: We show that there is a constant

C

such that for every

v a r e p s i l o n > 0

any

2

-coloured

K_{n}

with minimum degree at least

n / 4 + v a r e p s i l o n n

in both colours contains a complete subgraph on

2 t

vertices where one colour class forms a

K_{t, t}

, provided that

n g e q v a r e p s i l o n^{- C t}

. Also, we prove that if

K_{n}

is

2

-coloured with minimum degree at least

v a r e p s i l o n n

in both colours then it must contain one of two natural colourings of a complete graph. Both results are tight up to the value of

C

and they answer two recent questions posed by Kamv{c}ev and M"{u}yesser.

This page was built for publication: A note on unavoidable patterns in locally dense colourings