Local Configurations in Union-Closed Families
Jonad Pulaj, Kenan Wood

TL;DR
This paper advances the understanding of the Frankl union-closed sets conjecture by establishing new bounds, exploring symmetry, and introducing local configuration criteria to prove the conjecture for various classes of families.
Contribution
It provides new bounds for union-closed families satisfying the conjecture, addresses symmetry questions, and generalizes Poonen's Theorem to prove the conjecture in new cases.
Findings
New bounds for $FC(k, n)$ in union-closed families.
Answering Vaughan's symmetry question.
Proving the conjecture for several previously unknown classes.
Abstract
The Frankl or Union-Closed Sets conjecture states that for any finite union-closed family of sets containing some nonempty set, there is some element in the ground set of such that is in at least half of the sets in . In this work, we find new values and bounds for the least integer such that any union-closed family containing distinct -sets of an -set satisfies Frankl's conjecture with an element of . Additionally, we answer an older question of Vaughan regarding symmetry in union-closed families and we give a proof of a recent question posed by Ellis, Ivan and Leader. Finally, we introduce novel local configuration criteria through a generalization of Poonen's Theorem to prove the conjecture for many, previously unknown classes of families.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory
