Recent advances in explicit constructions of Ramsey graphs
Recent advances in explicit constructions of Ramsey graphs
-
Gil Cohen , Princeton University
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.