Extremal hypergraph problems and convex hulls
From MaRDI portal
Publication:1066910
DOI10.1007/BF02579438zbMath0579.05033MaRDI QIDQ1066910
Peter Frankl, Gyula O. H. Katona, Péter L. Erdős
Publication date: 1985
Published in: Combinatorica (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C65: Hypergraphs
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
Related Items
Polytopes determined by complementfree Sperner families, Sperner families satisfying additional conditions and their convex hulls, An intersection problem for codes, Profile vectors in the lattice of subspaces, Polytopes determined by hypergraph classes, Convex hulls of more-part Sperner families, Beyond the Erdős-Ko-Rado theorem, Extremal problems for finite sets and convex hulls---a survey, On the average rank of LYM-sets, G-Intersection Theorems for Matchings and Other Graphs
Cites Work