Proof of Rödl's theorem. Regularity and Turán's theorem produce a large family of pairwise regular classes. A three-color Ramsey argument yields either a sparse union in the graph, a sparse union in its complement, or sufficiently many intermediate-density pairs to embed an induced copy of the forbidden graph.