SCHWEITZER 1999 Problem 3

Prove that for any finite graph G there is a constant c(G)>0 such that for every n-point graph that does not have an induced subgraph isomorphic to G, there are two disjoint sets of vertices, each with at least $n^{c(G)}$ elements, between which either all edges are connected, or none of the edges are.