Friday, November 13, 2015
12:00 pm

CMI Seminar

Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs - part 1 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.

Contact Linda Taddeo ltaddeo@caltech.edu at 626-395-6704
Add this event to my calendar