Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the third part of a lecture series examining the profound connections between sunflowers in combinatorics and threshold phenomena in this 59-minute mathematical presentation. Delve into the sunflower conjecture of Erdős and Rado, a fundamental open problem in combinatorics that asks for the minimal size of a family of sets that must contain a sunflower of a given size, where a sunflower is defined as a family of sets whose pairwise intersections are all identical. Discover how recent major breakthroughs on this conjecture emerged through surprising connections to computational complexity theory, and learn about subsequent developments that revealed even more unexpected links to threshold phenomena, ultimately leading to the resolution of the Kahn-Kalai conjecture. Gain insight into how interdisciplinary connections between different fields of mathematics and theoretical computer science played a pivotal role in these groundbreaking results, with the presentation designed to be accessible to anyone with mathematical maturity and no specific prerequisites required.
