Set systems without a simplex or a cluster

DOI10.1007/S00493-010-2401-XzbMath1224.05249OpenAlexW2154099473WikidataQ105583407 ScholiaQ105583407MaRDI QIDQ532128

Dhruv Mubayi, Peter Keevash

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

zbMATH Keywords

Erdős-Ko-Rado theoremset system\(d\)-simplex, \(d\)-cluster

Mathematics Subject Classification ID

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

Related Items (24)

Hypergraphs without non-trivial intersecting subgraphs ⋮ TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM ⋮ A simple removal lemma for large nearly-intersecting families ⋮ Vertex isoperimetry and independent set stability for tensor powers of cliques ⋮ On the stability of the Erdős-Ko-Rado theorem ⋮ Triangles in intersecting families ⋮ The junta method in extremal hypergraph theory and Chvátal's conjecture ⋮ Unavoidable subhypergraphs: \(\mathbf a\)-clusters ⋮ Set systems without a 3-simplex ⋮ Shadows and intersections: Stability and new proofs ⋮ New results on simplex-clusters in set systems ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ An Unstable Hypergraph Problem with a Unique Optimal Solution ⋮ Note on set systems without a strong simplex ⋮ On set systems without a simplex-cluster and the junta method ⋮ On Mubayi's Conjecture and Conditionally Intersecting Sets ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ A hypergraph regularity method for generalized Turán problems ⋮ On the \(d\)-cluster generalization of Erdős-Ko-Rado ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ Set systems with union and intersection constraints ⋮ The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family ⋮ Unavoidable subhypergraphs: a-clusters ⋮ Regular intersecting families

Cites Work

• The complete intersection theorem for systems of finite sets
• On the hardness of approximating minimum vertex cover
• Pairwise intersections and forbidden configurations
• A new generalization of Mantel's theorem to \(k\)-graphs
• An exact Turán result for the generalized triangle
• On the measure of intersecting families, uniqueness and stability
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Exact solution of some Turán-type problems
• On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
• On Sperner families satisfying an additional condition
• A homological approach to two problems on finite sets
• The number of graphs without forbidden subgraphs
• Stability theorems for cancellative hypergraphs
• The Turán number of the Fano plane
• Proof of a conjecture of Erdős on triangles in set-systems
• On a hypergraph Turán problem of Frankl
• Erdős--Ko--Rado for three sets
• Minimal paths and cycles in set systems
• An intersection theorem for four sets
• 4-books of three pages
• An Elementary View of Euler's Summation Formula
• A Remark on Stirling's Formula
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Structure and stability of triangle-free set systems
• Intersecting Families are Essentially Contained in Juntas
• An Extremal Set-Intersection Theorem
• On a Conjecture of Chvátal on m -Intersecting Hypergraphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Triple Systems Not Containing a Fano Configuration
• On Triple Systems with Independent Neighbourhoods
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: Set systems without a simplex or a cluster