Two-source dispersers for polylogarithmic entropy and improved ramsey graphs
Two-source dispersers for polylogarithmic entropy and improved ramsey graphs
In his influential 1947 paper that inaugurated the probabilistic method, Erdős proved the existence of 2logn-Ramsey graphs on n vertices. Matching Erdős' result with a constructive proof is considered a central problem in combinatorics, that has gained a significant attention in the literature. The state of the art result was …