Skip to content
Preprint

Proof of the Erd\H{o}s-Szemer\'edi sunflower conjecture

Oct 2026 · 0 citations · 49 references
Mathematics

Abstract

In the 1970s, Erd\H{o}s and Szemer\'edi conjectured that for any $n \ge k-1\ge 2$, any collection of subsets of $[n]$ not containing a $k$-sunflower has size at most $c_k^n$ for some $c_k<2$. In the $k=3$ case, this follows from the work of Croot, Lev, and Pach and Ellenberg and Gijswijt on the cap-set problem, through a reduction due to Alon, Shpilka, and Umans. We prove the conjecture for every $k \ge 3$.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.