# The Erdös-Stone Theorem and its corollary

A nice presentation of the application I mentioned in class (the maximal edge density possible while avoiding an H-subgraph converges as n -> ∞) can be found in R. Diestel, Graph Theory, Chapter 7. The proof of the Erdös-Stone Theorem is given later, using the Szemeredi Regularity Lemma. We will discuss this lemma when we get to Szemeredi’s Theorem about arithmetic progressions in subsets of positive upper density.

Penn State has access to an e-book version of Diestel’s book.

Advertisements

Leave a Comment