Set systems without a 3-simplex
From MaRDI portal
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 , 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.
Recommendations
- Set systems without a strong simplex
- Set systems without a simplex or a cluster
- Note on set systems without a strong simplex
- Set Systems with No Singleton Intersection
- scientific article; zbMATH DE number 1101436
- Set systems with three intersections
- Structure and stability of triangle-free set systems
- On set systems without a simplex-cluster and the junta method
- scientific article; zbMATH DE number 3609704
- On set systems without weak 3-\(\Delta\)-subsystems
Cites work
- scientific article; zbMATH DE number 4200236 (Why is no real title available?)
- An Extremal Set-Intersection Theorem
- Exact solution of some Turán-type problems
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Proof of a conjecture of Erdős on triangles in set-systems
- Set systems without a simplex or a cluster
- Set systems without a strong simplex
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)
