*********************************** * Princeton Discrete Math Seminar * *********************************** Date: Thursday 22nd September, 3:00 in Fine Hall 224. Speaker: Gil Cohen (Princeton) Title: Recent advances in explicit constructions of Ramsey graphs In his 1947 paper that inaugurated the probabilistic method, Erdős proved the existence of (2 log n)-Ramsey graphs on n vertices. Matching Erdős' result with a constructive proof is an intriguing problem in combinatorics that has gained a significant attention in the literature. In this talk we will present recent works towards this goal. ----------- Next week: Bhargav Narayanan Anyone wishing to be added to or removed from this mailing list should contact Paul Seymour (pds@math.princeton.edu)