Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > OR CLOSED BOOLEAN STRINGS:
Reports tagged with OR closed boolean strings:
TR22-168 | 23rd November 2022
Zubayir Kazi

A Proof of the Generalized Union-Closed Set Conjecture assuming the Union-Closed Set Conjecture

Revisions: 2

Abstract The Union Closed Set Conjecture states that if a set system X\subseteq\mathcal{P}([n]) is closed under pairwise unions, then there exists a\in[n] in at least half of the sets of X. We show that there is a very natural generalization of the union closed set conjecture which gives a lower ... more >>>




ISSN 1433-8092 | Imprint