The union-closed sets conjecture for small families

DOI10.1007/S00373-016-1701-3zbMATH Open1440.05192arXiv1508.05718OpenAlexW2254776850WikidataQ123014584 ScholiaQ123014584MaRDI QIDQ343764FDOQ343764

Authors: Jens Maßberg 

Publication date: 29 November 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: We prove that the union-closed sets conjecture is true for separating union-closed families $mathcalA$ with $|mathcalA|leq2left(m+fracmlo{g}_2(m)-lo{g}_{2}lo{g}_2(m)ight)$ where $m$ denotes the number of elements in $mathcalA$.

Full work available at URL: https://arxiv.org/abs/1508.05718

zbMATH Keywords

Frankl's conjectureunion-closed sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05)

Cites Work

• Formalizing Frankl's conjecture: FC-families
• Title not available (Why is that?)
• A note on the union-closed sets conjecture
• Minimal weight in union-closed families
• The journey of the union-closed sets conjecture

Cited In (5)

• An Asymptotic Version of Frankl’s Conjecture
• An Average Set Size Theorem
• New conjectures for union-closed families
• On verifying and engineering the wellgradedness of a union-closed family
• Small maximally disjoint union-free families

This page was built for publication: The union-closed sets conjecture for small families

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