A short proof of Sperner's lemma
From MaRDI portal
Publication:5529497
DOI10.1016/S0021-9800(66)80035-2zbMath0151.01503WikidataQ55881639 ScholiaQ55881639MaRDI QIDQ5529497
Publication date: 1966
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
k-color Sperner theorems ⋮ Multicoloured extremal problems ⋮ All maximum 2-part Sperner families ⋮ A survey of some combinatorial results concerning functional dependencies in database relations. ⋮ On the average rank of LYM-sets ⋮ Extremal problems for finite sets and convex hulls---a survey ⋮ Families of chains of a poset and Sperner properties ⋮ Chain intersecting families ⋮ The cubical poset is additive ⋮ The number of unrelated partitions ⋮ A Sperner theorem on unrelated chains of subsets ⋮ Two new perspectives on multi-stage group testing ⋮ Pseudo-LYM inequalities and AZ identities ⋮ Sperner type theorems with excluded subposets ⋮ Supersaturation in posets and applications involving the container method ⋮ Some results on Sperner families ⋮ On Sperner families in which no k sets have an empty intersection ⋮ Packing posets in the Boolean lattice. ⋮ On counting Sperner families ⋮ A tour of \(M\)-part \(L\)-Sperner families ⋮ A Meshalkin theorem for projective geometries ⋮ Forbidden subposet problems with size restrictions ⋮ A LYM inequality for induced posets ⋮ Some good characterization results relating to the Kőnig-Egerváry theorem ⋮ On maximal families of subsets of a finite set ⋮ No four subsets forming an \(N\) ⋮ Manipulating the quota in weighted voting games ⋮ On maximal antichains consisting of sets and their complements ⋮ Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions ⋮ On nested chain decompositions of normalized matching posets of rank 3 ⋮ A new proof of the density Hales-Jewett theorem ⋮ On maximal antichains containing no set and its complement ⋮ An upper bound on the size of diamond-free families of sets ⋮ On Sperner families in which no k sets have an empty intersection. II ⋮ Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets ⋮ The partition method for poset-free families ⋮ An identity in combinatorial extremal theory ⋮ Strong qualitative independence. ⋮ On Sperner families in which no k sets have an empty intersection. III ⋮ Diamond-free families ⋮ On almost \(k\)-covers of hypercubes ⋮ A probabilistic proof for the Lym-inequality ⋮ Minimum number of affine simplices of given dimension ⋮ The local Kostant-PBW ordering ⋮ AZ-identities and strict 2-part Sperner properties of product posets ⋮ Fair division of indivisible items between two players: design parameters for contested pile methods ⋮ Tight bounds for adopt-commit objects ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ Largest families without an \(r\)-fork ⋮ An adaptive algorithm for group testing for complexes ⋮ On the linear extension complexity of regular \(n\)-gons ⋮ Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\) ⋮ Sharpening the LYM inequality ⋮ Approximation on Nash sets with monomial singularities ⋮ Towards a comprehensive theory of conflict-tolerance graphs ⋮ Helly property in finite set systems ⋮ Weighted cross-intersecting families ⋮ Sperner's theorem with constraints ⋮ The morphology of partially ordered sets ⋮ Orthogonal structures on finite partial orders ⋮ Extremal set theory for the binomial norm ⋮ Adjacency on the order polytope with applications to the theory of fuzzy measures ⋮ On Sperner families satisfying an additional condition ⋮ Extremal properties of collections of subsets containing no two sets and their union ⋮ Extremal problems among subsets of a set. (Reprint) ⋮ Uniformly cross intersecting families ⋮ Local matching in the function space of a partial order ⋮ Some new results on the Littlewood-Offord problem ⋮ Families of subsets without a given poset in double chains and Boolean lattices ⋮ Yanamoto inequality and gatherings ⋮ Old and new applications of Katona's circle ⋮ Anti-concentration for subgraph counts in random graphs ⋮ Localization near the edge for the Anderson Bernoulli model on the two dimensional lattice ⋮ Optimal conclusive sets for comparator networks ⋮ Exclusion and multiplicity for stable communities in Lotka-Volterra systems ⋮ Uniqueness in Harper's vertex-isoperimetric theorem ⋮ Minimum cutsets for an element of a Boolean lattice ⋮ Proof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-group ⋮ Extremal problems for sets forming Boolean algebras and complete partite hypergraphs ⋮ \(l\)-trace \(k\)-Sperner families of sets ⋮ An application of Dilworth's lattice of maximal antichains ⋮ Ramsey-Sperner theory ⋮ Sperner properties for groups and relations ⋮ \(Q _{2}\)-free families in the Boolean lattice ⋮ Maximum antichains in random subsets of a finite set ⋮ Colouring set families without monochromatic \(k\)-chains ⋮ Investigating posets via their maximal chains ⋮ Some remarks on normalized matching ⋮ Extremal problems among subsets of a set ⋮ Sperner systems consisting of pairs of complementary subsets ⋮ Solution of a problem of A. Ehrenfeucht and J. Mycielski ⋮ On Helly families of maximal size ⋮ Helly-type hypergraphs and Sperner families ⋮ Intersecting Sperner families and their convex hulls ⋮ The Sperner property for posets: A probabilistic approach ⋮ A generalization of the AZ identity ⋮ Poset-free families and Lubell-boundedness ⋮ A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains ⋮ The width of random subsets of Boolean lattices ⋮ Abelian groups yield many large families for the diamond problem
This page was built for publication: A short proof of Sperner's lemma
