Extremal hypergraph problems and convex hulls

DOI10.1007/BF02579438zbMath0579.05033OpenAlexW2028845083MaRDI QIDQ1066910

Peter Frankl, Péter L. Erdős

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579438

zbMATH Keywords

profilefamily of subsetsextreme pointsconvex hull

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (20)

On the average rank of LYM-sets ⋮ Results on the Wiener profile ⋮ Extremal problems for finite sets and convex hulls---a survey ⋮ Convex hulls of more-part Sperner families ⋮ A tour of \(M\)-part \(L\)-Sperner families ⋮ The Profile Polytope of Nontrivial Intersecting Families ⋮ Some inequalities concerning cross-intersecting families of integer sequences ⋮ The covering lemma and q-analogues of extremal set theory problems ⋮ G-Intersection Theorems for Matchings and Other Graphs ⋮ Sperner families satisfying additional conditions and their convex hulls ⋮ An intersection problem for codes ⋮ Profile polytopes of some classes of families ⋮ Beyond the Erdős-Ko-Rado theorem ⋮ Around the complete intersection theorem ⋮ Partition-free families of sets ⋮ Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals ⋮ Profile vectors in the lattice of subspaces ⋮ Generalized forbidden subposet problems ⋮ Polytopes determined by complementfree Sperner families ⋮ Polytopes determined by hypergraph classes

Cites Work

• Intersecting Sperner families and their convex hulls
• A simple proof of the Erdős-Chao Ko-Rado theorem
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite sets
• On a lemma of Littlewood and Offord
• Unnamed Item

This page was built for publication: Extremal hypergraph problems and convex hulls