An improved lower bound for the union-closed set conjecture
Abstract
Gilmer has recently shown that in any nonempty union-closed family F of subsets of a finite set, there exists an element contained in at least a proportion .01 of the sets of F. We improve the proportion from .01 to 3 -52 ≈ .38 in this result. An improvement to 12 would be the Frankl union-closed set conjecture. We follow Gilmer's method, replacing one key estimate by a sharp estimate. We then suggest a new addition to this method and sketch a proof that it can obtain a constant strictly greater than 3 -52 . We also disprove a conjecture of Gilmer that would have implied the union-closed set conjecture.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.