Linked from

The 3 pages that link to Erdős–Stone theorem, each with the reason it gives.

• Extremal combinatoricsRelated: It gives the asymptotic framework behind many forbidden-subgraph edge bounds.

• Turán's theoremRelated: It generalizes Turán's asymptotic density result beyond forbidden cliques.