Intersecting Sperner families and their convex hulls
From MaRDI portal
Publication:796532
DOI10.1007/BF02579153zbMath0544.05001OpenAlexW1991217473MaRDI QIDQ796532
Péter L. Erdős, Peter Frankl, Gyula O. H. Katona
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579153
Related Items
Intersecting \(P\)-free families, An Erdős-Ko-Rado theorem for integer sequences of given rank, Sequence Hypergraphs, Extremal problems for finite sets and convex hulls---a survey, Convex hulls of more-part Sperner families, The Profile Polytope of Nontrivial Intersecting Families, The covering lemma and q-analogues of extremal set theory problems, Sequence Hypergraphs: Paths, Flows, and Cuts, Sperner families satisfying additional conditions and their convex hulls, Profile polytopes of some classes of families, The convex hull of antichains in posets, Helly property in finite set systems, An Erdős-Ko-Rado theorem for restricted signed sets, An Erdős-Ko-Rado theorem for the subcubes of a cube, Profile vectors in the lattice of subspaces, Generalized forbidden subposet problems, Extremal hypergraph problems and convex hulls, Polytopes determined by complementfree Sperner families, Polytopes determined by hypergraph classes
Cites Work
- Sperner systems consisting of pairs of complementary subsets
- Existence theorems for Sperner families
- A minimization problem concerning subsets of a finite set
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Two applications (for search theory and truth functions) of Sperner type theorems
- Logarithmic order of free distributive lattice
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Extensions of the Erdös-Ko-Rado Theorem
- A short proof of Sperner's lemma
- A Combinatorial Theorem on Systems of Sets
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
