Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Explore the fundamental sunflower conjecture of Erdős and Rado in this first part of a lecture series delivered at the Park City Mathematics Institute. Delve into the basic combinatorial concept of sunflowers, where a family of sets has identical pairwise intersections, and examine the conjecture's question about the minimal size of set families that must contain sunflowers of given sizes. Discover how recent major breakthroughs leveraged unexpected connections to computational complexity theory, and learn about subsequent developments that revealed surprising links to threshold phenomena, ultimately leading to the resolution of the Kahn-Kalai conjecture. Gain insight into how interdisciplinary connections between mathematics and theoretical computer science proved pivotal in advancing these fundamental problems in extremal and probabilistic combinatorics, with no specific prerequisites required beyond mathematical maturity.
