Extremal problems for finite sets and convex hulls---a survey
From MaRDI portal
Publication:1356702
DOI10.1016/S0012-365X(96)00050-7zbMath0878.05079OpenAlexW1972667839MaRDI QIDQ1356702
Publication date: 13 July 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00050-7
extreme pointsconvex hullextremal problemsprofile vectorsLYM-inequalityinclusion-freetheorem of Sperner
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Extremal set theory (05D05)
Related Items
Union of shadows, Heawood inequalities, On the extremal combinatorics of the Hamming space, Multiply-intersecting families revisited, On a problem of Yuzvinsky on separating the n-cube, Cross-intersecting families of finite sets, Erdős-Ko-Rado theorem with conditions on the maximal degree, Exact solution of some Turán-type problems, A lower bound on the size of a complex generated by an antichain, EKR type inequalities for 4-wise intersecting families, Some results on Sperner families, Shadows of ordered graphs, On the orthogonal product of simplices and direct products of truncated Boolean lattices, A short proof for a theorem of Harper about Hamming-spheres, Isoperimetric inequalities for faces of the cube and the grid, Families of finite sets in which no set is covered by the union of two others, Brace-Daykin type inequalities for intersecting families, Cross-intersecting pairs of hypergraphs, An Erdős-Ko-Rado theorem for multisets, Some best possible inequalities concerning cross-intersecting families, A new bijection on rooted forests, Crossing properties of reliability functions, A multiply intersecting Erdős-Ko-Rado theorem -- the principal case, A new generalization of the Erdős-Ko-Rado theorem, Multiple cross-intersecting families of signed sets, Helly property in finite set systems, Another generalization of Lindström's theorem on subcubes of a cube, On Sperner families satisfying an additional condition, Contributions to the geometry of Hamming spaces, Applications of antilexicographic order. I: An enumerative theory of trees, On \(t\)-intersecting families of signed sets and permutations, Forbidding just one intersection, Compressions and isoperimetric inequalities, A new proof of the colored Kruskal-Katona theorem, The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
Cites Work
- The exact bound in the Erdős-Ko-Rado theorem
- A new short proof for the Kruskal-Katona theorem
- Intersecting Sperner families and their convex hulls
- Polytopes determined by complementfree Sperner families
- Sperner families satisfying additional conditions and their convex hulls
- Extremal hypergraph problems and convex hulls
- Polytopes determined by hypergraph classes
- All maximum 2-part Sperner families
- Convex hulls of more-part Sperner families
- Minimum shadows in uniform hypergraphs and a generalization of the Takagi function
- On the structure of maximum 2-part Sperner families
- Sperner systems consisting of pairs of complementary subsets
- Existence theorems for Sperner families
- On the average rank of LYM-sets
- Anti-blocking polyhedra
- 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
- On the average size of the sets in a Sperner family
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Extensions of the Erdös-Ko-Rado Theorem
- Optimization of the reliability polynomial in presence of mediocre elements
- Intersection theorems for systems of finite sets
- On generalized graphs
- A short proof of Sperner's lemma
- A Combinatorial Theorem on Systems of Sets
- The number of s-dimensional faces in a complex: An analogy between the simplex and the cube
- Blocking and anti-blocking pairs of polyhedra
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
