Recent advances in explicit constructions of Ramsey graphs

Recent advances in explicit constructions of Ramsey graphs

-
Gil Cohen , Princeton University
Fine Hall 224

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.