Two Results on Union-Closed Families
Ilan Karpas

TL;DR
This paper proves two new results about union-closed families: a density condition ensuring an element appears in at least half the sets, and a bound on the number of covering sets outside the family.
Contribution
It establishes a constant-density threshold for element frequency and bounds the number of external covering sets, advancing understanding of union-closed families.
Findings
If the family size exceeds a specific threshold, some element appears in at least half the sets.
The number of external sets covering the family is at most half of all possible sets.
Examples show the bounds are tight.
Abstract
We show that there is some absolute constant , such that for any union-closed family , if \mbox{}, then there is some element that appears in at least half of the sets of . We also show that for any union-closed family , the number of sets which are not in that cover a set in is at most , and provide examples where the inequality is tight.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · graph theory and CDMA systems
