Time: 4:00 p.m.
Location: 114 McAllister Building
Name: Ron Graham
Affiliation: Department of Computer Science and Engineering, UCSD
Title: Old and new problems and results in Ramsey theory
Abstract: Ramsey theory is a branch of combinatorics which deals with properties of structures which are preserved under partitions. Typical examples include van der Waerden's theorem on arithmetic progressions, Schur's theorem on solutions to x + y = z, and Ramsey's theorem itself for monochromatic cliques in edge-colored complete graphs. In this talk, I will summarize some of classic unsolved problems in this subject, and also describe some of the exciting new results that have recently appeared.
