Department of Mathematical Sciences

2011

Article

Rights Management

© by International Press of Boston

Abstract or Description

A finite graph G is {\em k-common} if the minimum (over all k-colourings of the edges of Kn) of the number of monochromatic labelled copies of G is asymptotically equal, as n tends to infinity, to the expected number of such copies in a random k-colouring of the edges of Kn. Jagger, \u{S}\u{t}oví\u{c}ek and Thomason showed that graphs which contain K4 are not 2-common. We prove that graphs which contain K3 are not 3-common.

DOI

10.4310/JOC.2011.v2.n1.a1

COinS

Published In

Journal of Combinitorics, 2, 1, 1-14.