Set systems without a 3-simplex

From MaRDI portal
Publication:641176

DOI10.1016/J.DISC.2011.06.024zbMATH Open1273.05228arXiv1010.5206OpenAlexW1992520196MaRDI QIDQ641176FDOQ641176


Authors: Michael E. Picollelli Edit this on Wikidata


Publication date: 21 October 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is for all nge1, with equality only achieved by the family of sets either containing a given element or of size at most 2. This extends a result of Keevash and Mubayi, who showed the conclusion for n sufficiently large.


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




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Set systems without a 3-simplex

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