Simplex stability

DOI10.1017/S0963548309009705MaRDI QIDQ3557500zbMATH OpenOpenAlexFDO

Authors Dhruv Mubayi, Reshma Ramadurai

Publication date 23 April 2010

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

Full work available at URL https://doi.org/10.1017/s0963548309009705

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Extremal set theory (05D05) Erd?s problems and related topics of discrete geometry (52C10)

Recommendations

• Set systems without a strong simplex
• Set systems without a simplex or a cluster
• Note on set systems without a strong simplex
• New results on simplex-clusters in set systems
• On set systems without a simplex-cluster and the junta method

Cites work

• A new generalization of the Erdős-Ko-Rado theorem
• An Extremal Set-Intersection Theorem
• An intersection theorem for four sets
• Erdős--Ko--Rado for three sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Minimal paths and cycles in set systems
• On a hypergraph Turán problem of Frankl
• Proof of a conjecture of Erdős on triangles in set-systems
• Stability theorems for cancellative hypergraphs
• Structure and stability of triangle-free set systems
• The Turán number of the Fano plane
• The Turán problem for projective geometries
• Triple Systems Not Containing a Fano Configuration

Cited in

(11)

• New results on simplex-clusters in set systems
• Simplices over finite fields
• Set systems without a strong simplex
• From Stability to Simplicity
• On Mubayi's conjecture and conditionally intersecting sets
• Set systems without a simplex or a cluster
• A product version of the Erdős-Ko-Rado theorem
• Large simple d-cycles in simplicial complexes
• Triangles in intersecting families
• The maximum size of intersecting and union families of sets
• Note on set systems without a strong simplex

This page was built for publication: Simplex stability

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