- Series
- Combinatorics Seminar
- Time
- Friday, December 6, 2019 - 1:05pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Jinyoung Park – Rutgers University – https://sites.google.com/view/jinyoungpark
- Organizer
- Lutz Warnke
(This is a joint event of the Combinatorics Seminar Series and the ACO Student Seminar.)
In this talk we will prove a conjecture of Talagrand, which is a fractional version of the “expectation-threshold” conjecture of Kalai and Kahn. This easily implies various difficult results in probabilistic combinatorics, e.g. thresholds for perfect hypergraph matchings (Johansson-Kahn-Vu) and bounded-degree spanning trees (Montgomery). Our approach builds on recent breakthrough work of Alweiss, Lovett, Wu, and Zhang on the Erdos-Rado “Sunflower Conjecture.”
This is joint work with Keith Frankston, Jeff Kahn, and Bhargav Narayanan.