Graduate Students
Graduate Programs     
Graduate Home Ph D Programs Masters Degree Ph D Program Requirements Course Descriptions Current Courses Admissions Current Graduate Students Graduate Student Seminar SIAM Chapter Seminar Recent Graduates Incoming Students

Apply Now
Graduate Seminar

Andrew Zucker
Carnegie Mellon University
Title: Devlin's Theorem

Abstract: By now, many of us are familiar with Ramsey's theorem: color the edges of a countably infinite complete graph with two colors, and there is some infinite complete subgraph all of whose edges are one color. But suppose we add some extra structure; now we suppose our vertices are rational numbers, and we demand that our monochromatic subgraph has the order type of the rationals. While this generalization of Ramsey's theorem is false, we will prove something slightly weaker and much more interesting.

Date: Tuesday, September 2, 2014
Time: 5:30 pm
Location: Wean Hall 8220
Submitted by:  Zilin Jiang