A counterexample to the generalisation of Sperner's theorem

DOI10.1016/0097-3165(71)90063-XzbMath0257.05022OpenAlexW2102266693WikidataQ29042520 ScholiaQ29042520MaRDI QIDQ2559483

R. P. Dilworth, Curtis Greene

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1016/0097-3165(71)90063-x

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of matroids and geometric lattices (05B35) Structure theory of lattices (06B05) Modular lattices, Desarguesian lattices (06C05)

Related Items (15)

Symmetric decompositions and the strong Sperner property for noncrossing partition lattices ⋮ Obituary: R. P. Dilworth ⋮ On Whitney numbers of Dowling lattices ⋮ Combinatorial geometry takes the lead ⋮ The global theory of flows in networks ⋮ Positive association in the fractional fuzzy Potts model ⋮ The morphology of partially ordered sets ⋮ Orthogonal structures on finite partial orders ⋮ Symmetrische Zerlegung von Kettenprodukten ⋮ Superantichains in the Lattice of Partitions of a Set ⋮ Connected matroids with the smallest Whitney numbers ⋮ Uniform binary geometries ⋮ On a problem of Rota ⋮ Unnamed Item ⋮ The size of the largest antichain in the partition lattice

Cites Work

• The morphology of partially ordered sets
• Structured theorems for relatively complemented lattices
• A generalization of Sperner's lemma

This page was built for publication: A counterexample to the generalisation of Sperner's theorem