Title:Recent Advances in Explicit Constructions of Ramsey graphs"
Speaker: Gil Cohen, IAS
Date: Monday, November 7, 2016 2:00 pm
Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ
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 significant attention in the literature. In this talk, we will present recent works towards this goal.