Polytopes determined by hypergraph classes

DOI10.1016/S0195-6698(85)80033-0zbMath0588.05031OpenAlexW2014496760MaRDI QIDQ1073043

Peter Frankl, Gyula O. H. Katona

Publication date: 1985

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(85)80033-0

zbMATH Keywords

Erdős-Ko-Rado theoremconvex hullsSperner propertyextremal hypergraph problemsKatona-Kruskal theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05) Polytopes and polyhedra (52Bxx)

Related Items

Extremal problems for finite sets and convex hulls---a survey, Convex hulls of more-part Sperner families, Some inequalities concerning cross-intersecting families of integer sequences, Profile polytopes of some classes of families, Generalized forbidden subposet problems

Cites Work

• A new short proof for the Kruskal-Katona theorem
• Intersecting Sperner families and their convex hulls
• Extremal hypergraph problems and convex hulls
• On Sperner families in which no k sets have an empty intersection
• On Sperner families satisfying an additional condition
• Existence theorems for Sperner families
• A minimization problem concerning subsets of a finite set
• Two applications (for search theory and truth functions) of Sperner type theorems
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item