We continue our exploration of ultrafilters. Today we’ll discuss the infinite Ramsey theorem, which is the following classical result: Theorem: Suppose the complete graph on countably many vertices has its edges colored in one of colors. Then there is a monochromatic (i.e. an infinite subgraph all of whose edges are the same color). The finite [...]
Archive for the ‘Ramsey theory’ Category
Ultrafilters in Ramsey theory
Posted in logic and set theory, Ramsey theory, tagged pigeonhole principle, ultrafilters on December 14, 2010 | 16 Comments »
Ramsey theory and Fermat’s Last Theorem
Posted in graph theory, number theory, Ramsey theory, tagged pigeonhole principle on October 13, 2010 | 3 Comments »
In the first few lectures of Graph Theory, the lecturer (Paul Russell) presented a cute application of Ramsey theory to Fermat’s Last Theorem. It makes a great introduction to the general process of casting a problem in one branch of mathematics as a problem in another and is the perfect size for a blog post, [...]
-
Recent Comments
Qiaochu Yuan on The Yoneda lemma I Qiaochu Yuan on The Jacobson radical Joe Hannon on The Yoneda lemma I Amy Szczepanski on The Jacobson radical Qiaochu Yuan on The Yoneda lemma I -
Recent Posts
Categories
Archives
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- August 2011
- July 2011
- June 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009
- July 2009
- June 2009
- May 2009
- April 2009
- January 2009
Tag Cloud
