On the Erdős-Rado Sunflower Conjecture
Year: 2026
Type: preprint
Abstract: This preprint provides an exhaustive mathematical treatise on the Erdős-Rado Sunflower Lemma and Conjecture (Problem #68 in Paul Erdős' collection), a foundational result in extremal combinatorics and theoretical computer science. A collection of distinct sets $\mathcal{S} = \{S_1, S_2, \dots, S_r\}$ is called a sunflower (or $\Delta$-system) with $r$ petals and core $Y$ if: $$\forall i \ne j, \quad S_i \cap S_j = Y$$ In 1960, Paul Erdős and Richard Rado proved that any $k$-uniform family containing more than $k!(r-1)^k$ sets must contain an $r$-petal sunflower, and conjectured that the factorial threshold $k!$ can be replaced by a purely exponential bound $C(r)^k$ independent of $k$. Key Mathematical Results & Contributions Foundational Base Case ($k = 1$): Formal set-theoretic proof that every family of $1$-element sets forms an exact sunflower with empty core $Y = \emptyset$. Classical Erdős-Rado Inductive Proof: Complete, step-by-step exposition of the classical $k!(r-1)^k$ threshold via maximal pairwise disjoint matchings $\mathcal{M}$ and vertex extraction using the Pigeonhole Principle. Hypergraph Shadows & Extension Families: Rigorous structural formulation of the $(k-1)$-shadow $\partial \mathcal{F} = \{E \subset \mathbb{N} \mid |E| = k-1, \exists F \in \mathcal{F}, E \subset F\}$ and extension families $\mathcal{F}_E = \{F \in \mathcal{F} \mid E \subseteq F\}$. The Extension Sunflower Theorem: Complete, non-elliptical proof that for every $(k-1)$-element core $E \in \partial \mathcal{F}$, the entire extension family $\mathcal{F}_E$ forms an exact sunflower with core $E$ (derived from proper subset inclusion and equal cardinalities $|A \cap B| = |E| = k-1$). Double-Counting Shadow Inequality: Demonstration that on the bipartite incidence graph between $k$-uniform edges and their $(k-1)$-shadows, the total number of incidences satisfies: $$|\mathcal{F}| \le \frac{\tau(\mathcal{F})}{k} |\partial \mathcal{F}|$$ where $\tau(\mathcal{F})$ is the maximum number of petals in any sunflower in $\mathcal{F}$. The Alweiss-Lovett-Wu-Zhang Revolution (2020): Pedagogical survey of the ALWZ breakthrough improving the bound to $(C r \log(kr))^k$ via $q$-spread hypergraphs and iterative Shannon entropy encodings. 100% Machine-Checked Verification in Lean 4 Repository and Verification Artifacts The companion machine-checked code and formal verification artifacts are publicly hosted on GitHub: https://github. com/flouzzy/erdos-problems Primary MSC (2020): 05D05, 05C65, 68V20, 05A18, 68R05.Keywords: Erdős-Rado Sunflower Lemma, $\Delta$-Systems, Extremal Set Theory, Hypergraph Shadows, Spread Measures, Formal Verification, Lean 4, Mathlib.
Author: EDOU NZE, Charles
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7203701969
Cites:
Cited by:
Related to: