A stability result for the union-closed size problem

From MaRDI portal
Publication:5366897

DOI10.1017/S0963548315000176zbMATH Open1372.05016arXiv1311.2298OpenAlexW3103079811MaRDI QIDQ5366897FDOQ5366897


Authors: Tom Eccles Edit this on Wikidata


Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Abstract: A family of sets is called union-closed if whenever A and B are sets of the family, so is AcupB. The long-standing union-closed conjecture states that if a family of subsets of [n] is union-closed, some element appears in at least half the sets of the family. A natural weakening is that the union-closed conjecture holds for large families; that is, families consisting of at least p02n sets for some constant p0. The first result in this direction appears in a recent paper of Balla, Bollob'as and Eccles cite{BaBoEc}, who showed that union-closed families of at least frac232n sets satisfy the conjecture --- they proved this by determining the minimum possible average size of a set in a union-closed family of given size. However, the methods used in that paper cannot prove a better constant than frac23. Here, we provide a stability result for the main theorem of cite{BaBoEc}, and as a consequence we prove the union-closed conjecture for families of at least (frac23c)2n sets, for a positive constant c.


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




Recommendations



Cites Work


Cited In (5)





This page was built for publication: A stability result for the union-closed size problem

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