The Erdős–Hajnal conjecture

Show that graphs avoiding a fixed induced subgraph H always contain a clique or independent set of size n^{c(H)}.