The <graph Ramsey number> $R(G,H)$ is the smallest $N$ such that every red-blue coloring of the edges of $K_N$ has a red copy of $G$ or a blue copy of $H$. These copies are subgraphs, not necessarily induced. Equivalently every <graph> on $N$ vertices contains $G$ or its complement contains $H$.

Solution

Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford / 2007 / A / 3 / b / Solution

 Solution (source code)