Note on set systems without a strong simplex

DOI10.1016/j.disc.2010.02.003zbMath1225.05235OpenAlexW2015695984MaRDI QIDQ968446

Rudy X. J. Liu, Mingyong Feng

Publication date: 5 May 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.02.003

zbMATH Keywords

Erdős-Ko-Rado theorem\(d\)-simplexChvàtal's simplex conjecturestrong \(d\)-simplex

Mathematics Subject Classification ID

Extremal set theory (05D05) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Unnamed Item
• Set systems without a simplex or a cluster
• Exact solution of some Turán-type problems
• Proof of a conjecture of Erdős on triangles in set-systems
• Minimal paths and cycles in set systems
• Set Systems without a Strong Simplex
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Simplex Stability
• An Extremal Set-Intersection Theorem
• On generalized graphs

This page was built for publication: Note on set systems without a strong simplex