A generalization of Sperner's lemma

DOI10.1016/S0021-9800(69)80129-8zbMath0175.28402WikidataQ124884841 ScholiaQ124884841MaRDI QIDQ5565140

Kirby A. Baker

Publication date: 1969

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

combinatorics

Related Items (20)

Integer partitions and the Sperner property ⋮ On counting Sperner families ⋮ AZ-identities and strict 2-part Sperner properties of product posets ⋮ The morphology of partially ordered sets ⋮ Orthogonal structures on finite partial orders ⋮ Unnamed Item ⋮ Local matching in the function space of a partial order ⋮ Strong properties in partially ordered sets. I ⋮ Maximum Antichains: A Sufficient Condition ⋮ The size of the largest antichain in the partition lattice ⋮ An application of Dilworth's lattice of maximal antichains ⋮ Hyperplane cuts of an n-cube ⋮ Sperner properties for groups and relations ⋮ The number of partially ordered sets ⋮ Hypergraphs and Sperner's theorem ⋮ A counterexample to the generalisation of Sperner's theorem ⋮ Avoiding brooms, forks, and butterflies in the linear lattices ⋮ Enumerating fuzzy switching functions and free Kleene algebras ⋮ The Sperner property for posets: A probabilistic approach ⋮ Counting common representatives and symmetric chain decompositions

This page was built for publication: A generalization of Sperner's lemma