 Solution

ID: past-exam-of-the-graph-theory-and-probabilistic-combinatorics-course-of-the-university-of-oxford/2008/a/3/c/solution

R (G, H)

is the least

N

such that every red-blue coloring of the edges of

K_{N}

contains a red copy of

G

or a blue copy of

H

. Copies are ordinary subgraphs, not necessarily induced. Equivalently every graph on

N

vertices contains

G

or its complement contains

H

 New to topics? Read the docs here!