REVIEW 2 cited by
Approximate union closed conjecture
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
A set system is called union closed if for any two sets in the set system their union is also in the set system. Gilmer recently proved that in any union closed set system some element belongs to at least a $0.01$ fraction of sets, and conjectured that his technique can be pushed to the constant $\frac{3-\sqrt{5}}{2}$. We verify his conjecture; show that it extends to approximate union closed set systems, where for nearly all pairs of sets their union belong to the set system; and show that for such set systems this bound is optimal.
Forward citations
Cited by 2 Pith papers
-
Entropy approach for a generalization of Frankl's conjecture
A set family has an element in at least half its sets if and only if there exists an auxiliary family G satisfying an entropy inequality, giving a new equivalent form of Frankl's conjecture.
-
Entropy methods in combinatorics
A selective survey of entropy methods in combinatorics, detailing randomized chain rules, Shearer's inequality, random homomorphisms, Pinsker-type arguments, the union-closed sets breakthrough, and entropy approaches ...
Discussion (0). Continue with ORCID to comment.