Recent advances in explicit constructions of Ramsey graphs

Thursday, September 22, 2016 -
3:00pm to 4:30pm
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.
Speaker: 
Gil Cohen
Princeton University
Event Location: 
Fine Hall 224