Skip to content

The Erdös-Stone Theorem and its corollary

September 2, 2011

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.


From → Uncategorized

Leave a Comment

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: