In this survey talk, we discuss the connection between Alweiss-Lovett-Wu-Zhang’s breakthrough [1] on the Erdos-Rado Sunflower Conjecture and the recent develop- ments around…
Statement
In this survey talk, we discuss the connection between Alweiss-Lovett-Wu-Zhang’s breakthrough [1] on the Erdos-Rado Sunflower Conjecture and the recent develop- ments around thresholds in probabilistic combinatorics, including the resolution of a conjecture of Talagrand due to Frankston-Kahn-Narayanan-Park [2] and the Kahn-Kalai Conjecture due to Park-Pham [4]. A collection of sets S1 , . . . , Sr is an r-sunflower if Si \cap Sj = S1 \cap \cdot \cdot \cdot \cap Sr \foralli 6= j, and the celebrated Erdős-Rado Sunflower Conjecture is: Conjecture 1. When Sunflowers Meet Thresholds Jinyoung Park (joint work with Keith Frankston, Jeff Kahn, Bhargav Narayanan, Huy Tuan Pham) Theorem 4 provides a sufficient condition (i.e., spread) for an \alpha-random subset of X contains a member of given set system F with a certain probability, which is closely related to the notion of thresholds in random graph theory.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.