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

DOI10.1016/0097-3165(81)90004-2MaRDI QIDQ1159695zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3691331 (Why is no real title available?)
• scientific article; zbMATH DE number 3453609 (Why is no real title available?)
• An Extremal Set-Intersection Theorem
• Extremal problems and coverings of the space
• On Sperner families satisfying an additional condition
• On a Conjecture of Chvátal on m -Intersecting Hypergraphs

Cited in

(8)

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

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

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