Extremal problems for finite sets and convex hulls---a survey
From MaRDI portal
(Redirected from Publication:1356702)
Recommendations
Cites work
- A Combinatorial Theorem on Systems of Sets
- A minimization problem concerning subsets of a finite set
- A new short proof for the Kruskal-Katona theorem
- A short proof of Sperner's lemma
- A simple proof of the Erdős-Chao Ko-Rado theorem
- All maximum 2-part Sperner families
- Anti-blocking polyhedra
- Blocking and anti-blocking pairs of polyhedra
- Convex hulls of more-part Sperner families
- Existence theorems for Sperner families
- Extensions of the Erdös-Ko-Rado Theorem
- Extremal hypergraph problems and convex hulls
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- scientific article; zbMATH DE number 4170907 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3760172 (Why is no real title available?)
- scientific article; zbMATH DE number 15363 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 468608 (Why is no real title available?)
- Intersecting Sperner families and their convex hulls
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of finite sets
- Minimum shadows in uniform hypergraphs and a generalization of the Takagi function
- On generalized graphs
- On the average rank of LYM-sets
- On the average size of the sets in a Sperner family
- On the structure of maximum 2-part Sperner families
- Optimization of the reliability polynomial in presence of mediocre elements
- Polytopes determined by complementfree Sperner families
- Polytopes determined by hypergraph classes
- Sperner families satisfying additional conditions and their convex hulls
- Sperner systems consisting of pairs of complementary subsets
- The exact bound in the Erdős-Ko-Rado theorem
- The number of s-dimensional faces in a complex: An analogy between the simplex and the cube
- Two applications (for search theory and truth functions) of Sperner type theorems
Cited in
(44)- On t-intersecting families of signed sets and permutations
- Profile vectors in the lattice of subspaces
- Forbidding just one intersection
- Extremal hypergraph problems and convex hulls
- Polytopes determined by hypergraph classes
- Heawood inequalities
- On a problem of Yuzvinsky on separating the n-cube
- 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
- Some results on Sperner families
- A short proof for a theorem of Harper about Hamming-spheres
- Families of finite sets in which no set is covered by the union of two others
- Some best possible inequalities concerning cross-intersecting families
- Crossing properties of reliability functions
- Helly property in finite set systems
- On Sperner families satisfying an additional condition
- Contributions to the geometry of Hamming spaces
- A new proof of the colored Kruskal-Katona theorem
- On the orthogonal product of simplices and direct products of truncated Boolean lattices
- Union of shadows
- On the extremal combinatorics of the Hamming space
- Cross-intersecting families of finite sets
- Multiply-intersecting families revisited
- Shadows of ordered graphs
- Brace-Daykin type inequalities for intersecting families
- scientific article; zbMATH DE number 3847436 (Why is no real title available?)
- scientific article; zbMATH DE number 5302813 (Why is no real title available?)
- scientific article; zbMATH DE number 468608 (Why is no real title available?)
- scientific article; zbMATH DE number 736293 (Why is no real title available?)
- Cross-intersecting pairs of hypergraphs
- Extremal sets of the family of intervals
- An Erdős-Ko-Rado theorem for multisets
- A new generalization of the Erdős-Ko-Rado theorem
- A new bijection on rooted forests
- Another generalization of Lindström's theorem on subcubes of a cube
- Applications of antilexicographic order. I: An enumerative theory of trees
- Compressions and isoperimetric inequalities
- Polytopes determined by complementfree Sperner families
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- EKR type inequalities for 4-wise intersecting families
- Isoperimetric inequalities for faces of the cube and the grid
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
- Multiple cross-intersecting families of signed sets
This page was built for publication: Extremal problems for finite sets and convex hulls---a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356702)