Improved Lower Bound for Frankl’s Union-Closed Sets Conjecture

Key Points

Key points are not available for this paper at this time.

Abstract

We verify an explicit inequality conjectured in Gilmer, 2022, arXiv: 2211. 09055, thus proving that for any nonempty union-closed family F 2^n, some i n is contained in at least a 3-52 0. 38 fraction of the sets in F \. One case, an explicit one-variable inequality, is checked by computer calculation.

Read Full Paperexternally

Bookmark

View Full Paper

Cite This Study

Alweiss et al. (Fri,) studied this question.

synapsesocial.com/papers/68e57d42b6db64358751ca5d https://doi.org/https://doi.org/10.37236/12232

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1The Union-Closed Set Conjecture is True2024
2The union-closed set conjecture is true2024
3Chain Conditions and Optimal Elements in Generalized Union-Closed Families of Sets2025
4A Study On The Graph Formulation Of Union Closed Sets Conjecture2024
5Note on the union-closed sets conjecture and Reimer's average set size theorem2024

Bookmark

View Full Paper