Graphs containing triangles are not 3-common

A finite graph G is k-common if the minimum (over all kcolourings 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, Stovicek and Thomason showed that graphs which contain K4 are not 2-common. We prove that graphs which contain K3 are not 3-common.