### Joonkyung Lee (이준경), On Ramsey multiplicity

### Joonkyung Lee (이준경), On Ramsey multiplicity

Ramsey's theorem states that, for a fixed graph $H$, every 2-edge-colouring of $K_n$ contains a monochromatic copy of $H$ whenever $n$ is large enough. Perhaps one of the most natural questions after Ramsey's theorem is then how many copies of monochromatic $H$ can be guaranteed to exist. To formalise this question, let the Ramsey multiplicity …