Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2018/ii/paper-1/17i/a/solution

Write
Let be an -free graph on vertices with edges, and choose a uniformly random set of vertices. Its induced subgraph is still -free, and each edge survives with probability . Hence
so . Thus the normalized extremal number is nonincreasing and bounded below by zero, proving that

New to topics? Read the docs here!