Set Systems without a Strong Simplex

DOI10.1137/090760775zbMath1273.05227OpenAlexW2004224222MaRDI QIDQ3008025

Tao Jiang, Oleg Pikhurko, Zelealem B. Yilma

Publication date: 17 June 2011

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

Full work available at URL: https://doi.org/10.1137/090760775

zbMATH Keywords

shadowsErdős-Ko-Radoset systemsTurán functioncombinatorial simplex

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (6)

Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ Triangles in intersecting families ⋮ Hypergraph Turán numbers of linear cycles ⋮ Unavoidable subhypergraphs: \(\mathbf a\)-clusters ⋮ Set systems without a 3-simplex ⋮ Note on set systems without a strong simplex

This page was built for publication: Set Systems without a Strong Simplex