The ACO Seminar (2011-2012)

Let G be a finite graph and let t > 1 be a natural number. The Ramsey multiplicity constant C_t(G) measures the minimum density of monochromatic copies of G in t-colourings of the edges of a large complete graph. We use Razborov's flag algebra method to compute the exact value of C_3(K_3).

Joint work with Michael Young.