CMI Seminar
Annenberg 213
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs - part 2 of 2
Gil Cohen,
CMI Postdoctoral Fellow,
CMS,
Caltech,
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 a central problem in combinatorics that has gained a significant attention in the literature. In this talk we will present a recent work towards this goal (http://eccc.hpi-web.de/report/2015/095/).
No prior knowledge will be assumed.
For more information, please contact Linda Taddeo by phone at 626-395-6704 or by email at ltaddeo@caltech.edu or visit Mathematics of Information Seminar - Upcoming Events.