Union-Closed Sets Conjecture (Frankl's Conjecture)
Canonical statement
View source LaTeX
Let \(\mathcal F\) be a finite, nonempty family of finite
sets such that \(A\cup B\in\mathcal F\) for all
\(A,B\in\mathcal F\), and assume \(\bigcup\mathcal F\ne\varnothing\).
Then some element \(x\in\bigcup\mathcal F\) belongs to at least
\(\lvert\mathcal F\rvert/2\) members of \(\mathcal F\).Notes
Frankl's conjecture, dating from 1979, concerns finite families of finite sets closed under union: if implies and contains a nonempty set, then some element of the ground set should lie in at least half of the members of . Despite its innocuous appearance the problem has resisted a wide range of techniques; its history and the many partial approaches are surveyed by Bruhn and Schaudt [BruhnSchaudt2015].
The conjecture has been verified in numerous special cases, such as families over small ground sets or with structural restrictions. A recent breakthrough came from an information-theoretic method that yields a universal constant: every union-closed family has an element belonging to at least a fixed fraction of its sets. The bound was established along these lines by Alweiss, Huang and Sellke [AlweissHuangSellke2024].
The gap between and the conjectured sharp value is exactly what remains, and closing it may require ideas beyond the present arguments; the conjecture is open.
References (2)
- [BruhnSchaudt2015]
The journey of the union-closed sets conjecture
Open ↗Henning Bruhn and Oliver Schaudt · 2074 · misc
- [AlweissHuangSellke2024]
Improved lower bound for the union-closed sets conjecture
Open ↗Ryan Alweiss and Brice Huang and Mark Sellke · 2024 · misc
The boxed statement is the canonical open formulation — not a stronger variant or a related research program. The status reflects the catalog's last review; do your own literature search before investing serious effort.