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