On the number of union-free families

From MaRDI portal
Publication:2357013



Abstract: A family of sets is union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to the third set. Kleitman proved that every union-free family has size at most . Later, Burosch--Demetrovics-Katona-Kleitman-Sapozhenko asked for the number alpha(n) of such families, and they proved that . They conjectured that the constant 2sqrt2 can be removed in the exponent of the right hand side. We prove their conjecture by formulating a new container-type theorem for rooted hypergraphs.












This page was built for publication: On the number of union-free families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357013)