The Sunflower Conjecture Proven

Abstract

We demonstrate the truth of the sunflower conjecture by showing that a family $\mathcal{F}$ of sets each of cardinality at most $m$ includes a $k$-sunflower, if $|\mathcal{F}|>(c{k}^4{)}^m$ for a constant $c>0$ independent of $m$ and $k$, where $k$-sunflower means a family of $k$ different sets with a common pairwise intersection.

8 pages to fix the error of Ver. 2. Please visit https://sites.psu.edu/sunflowerconjecture/2022/12/18/index-page/ for additional information on the proof