|Title: One trick with two applications|
|Speaker: Mathias Schacht of The University of Hamburg and Yale University|
|Contact: Dwight Duffus, email@example.com|
|Date: 2019-12-06 at 4:00PM|
|Venue: MSC W303|
We discuss a recent key lemma of Alweiss, Lovett, Wu and Zhang which led to big improvement for the Erdos-Rado sunflower problem. Essentially the same lemma was also crucial in the recent work of Frankston, Kahn, Narayanan, and Park showing that thresholds of increasing properties of binomial random discrete structures are at most a log-factor away from the so-called (fractional) expectation threshold. This fairly general result gives a new proof of the Johansson-Kahn-Vu theorem for perfect matchings in random hypergraphs.
See All Seminars