Set systems without a simplex or a cluster
From MaRDI portal
Publication:532128
DOI10.1007/S00493-010-2401-XzbMATH Open1224.05249OpenAlexW2154099473WikidataQ105583407 ScholiaQ105583407MaRDI QIDQ532128FDOQ532128
Authors: Peter Keevash, Dhruv Mubayi 
Publication date: 26 April 2011
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-010-2401-x
Recommendations
Cites Work
- On a hypergraph Turán problem of Frankl
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A Remark on Stirling's Formula
- The complete intersection theorem for systems of finite sets
- On the hardness of approximating minimum vertex cover
- Exact solution of some Turán-type problems
- A homological approach to two problems on finite sets
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The number of graphs without forbidden subgraphs
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Intersecting Families are Essentially Contained in Juntas
- Pairwise intersections and forbidden configurations
- On the measure of intersecting families, uniqueness and stability
- Minimal paths and cycles in set systems
- Proof of a conjecture of Erdős on triangles in set-systems
- A new generalization of the Erdős-Ko-Rado theorem
- Stability theorems for cancellative hypergraphs
- The Turán number of the Fano plane
- Triple Systems Not Containing a Fano Configuration
- An exact Turán result for the generalized triangle
- On Triple Systems with Independent Neighbourhoods
- On Sperner families satisfying an additional condition
- An Elementary View of Euler's Summation Formula
- An intersection theorem for four sets
- An Extremal Set-Intersection Theorem
- 4-books of three pages
- A new generalization of Mantel's theorem to \(k\)-graphs
- Erdős--Ko--Rado for three sets
- On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
- Structure and stability of triangle-free set systems
- On a Conjecture of Chvátal on m -Intersecting Hypergraphs
Cited In (28)
- On set systems without a simplex-cluster and the junta method
- Removal and stability for Erdős-Ko-Rado
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- Regular intersecting families
- New results on simplex-clusters in set systems
- Vertex isoperimetry and independent set stability for tensor powers of cliques
- Simplex stability
- On the \(d\)-cluster generalization of Erdős-Ko-Rado
- Exchange properties of finite set-systems
- Set systems without a strong simplex
- On the stability of the Erdős-Ko-Rado theorem
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
- An unstable hypergraph problem with a unique optimal solution
- Transference for the Erdős-Ko-Rado theorem
- A simple removal lemma for large nearly-intersecting families
- On Mubayi's conjecture and conditionally intersecting sets
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- The junta method in extremal hypergraph theory and Chvátal's conjecture
- Hypergraphs without non-trivial intersecting subgraphs
- Triangles in intersecting families
- Shadows and intersections: Stability and new proofs
- Set systems without a 3-simplex
- A hypergraph regularity method for generalized Turán problems
- Note on set systems without a strong simplex
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Families of sets with intersecting clusters
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- Set systems with union and intersection constraints
This page was built for publication: Set systems without a simplex or a cluster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q532128)
