On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex

DOI10.1016/0097-3165(81)90004-2zbMath0475.05066OpenAlexW1977715839MaRDI QIDQ1159695

Peter Frankl

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(81)90004-2

zbMATH Keywords

intersecting set-systems

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items (8)

Hypergraphs without non-trivial intersecting subgraphs ⋮ Exact solution of some Turán-type problems ⋮ New results on simplex-clusters in set systems ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Set systems without a simplex or a cluster ⋮ Helly property in finite set systems ⋮ Invitation to intersection problems for finite sets ⋮ Structure and stability of triangle-free set systems

Cites Work

• Extremal problems and coverings of the space
• On Sperner families satisfying an additional condition
• An Extremal Set-Intersection Theorem
• On a Conjecture of Chvátal on m -Intersecting Hypergraphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex