Maximal sized antichains in partial orders

DOI10.1016/0012-365X(71)90006-9MaRDI QIDQ2546211zbMATH OpenWikidataFDO

Authors Daniel J. Kleitman, M. Edelberg, David Lubell

Publication date 1971

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(71)90006-9

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07)

Cites work

• A short proof of Sperner's lemma
• On a lemma of Littlewood and Offord
• On Rota's problem concerning partitions

Cited in

(21)

• The Sperner property for posets: A probabilistic approach
• A new proof of a theorem of Harper on the Sperner-Erdős problem
• Optimal representations of partially ordered sets and a limit Sperner theorem
• Maximum antichains of rectangular arrays
• A simple counterexample to a conjecture of Rota
• Orthogonal structures on finite partial orders
• Automorphisms of lexicographic products
• Contributions to the geometry of Hamming spaces
• On the number of prime implicants
• The size of the largest antichain in the partition lattice
• Proof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-group
• Strong Sperner property of the subgroup lattice of an Abelian \(p\)-group
• Integer partitions and the Sperner property
• A Generalized Rota Conjecture for Partitions
• Superantichains in the Lattice of Partitions of a Set
• Intersecting antichains and shadows in linear lattices
• On the lattice of maximum-sized antichains of a finite poset
• The structure of Sperner k-families
• The structure of Sperner k-families
• An application of Dilworth's lattice of maximal antichains
• q-weighted log-concavity and q-product theorem on the normality of posets

This page was built for publication: Maximal sized antichains in partial orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2546211)