CMI Seminar

Tuesday November 24, 2015 4:00 PM

Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs - part 2 of 2

Speaker: Gil Cohen, CMS, Caltech
Location: Annenberg 213

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.

Series Center for the Mathematics of Information Seminar Series

Contact: Linda Taddeo at 626-395-6704 ltaddeo@caltech.edu
For more information visit: http://www.cmi.caltech.edu/events.shtml