Maximal sized antichains in partial orders
From MaRDI portal
Publication:2546211
DOI10.1016/0012-365X(71)90006-9zbMath0217.02701WikidataQ56679826 ScholiaQ56679826MaRDI QIDQ2546211
M. Edelberg, Daniel J. Kleitman, David Lubell
Publication date: 1971
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (21)
Integer partitions and the Sperner property ⋮ Optimal representations of partially ordered sets and a limit Sperner theorem ⋮ Maximum antichains of rectangular arrays ⋮ A simple counterexample to a conjecture of Rota ⋮ \(q\)-weighted log-concavity and \(q\)-product theorem on the normality of posets ⋮ The structure of Sperner k-families ⋮ Orthogonal structures on finite partial orders ⋮ Intersecting antichains and shadows in linear lattices ⋮ Automorphisms of lexicographic products ⋮ A Generalized Rota Conjecture for Partitions ⋮ Superantichains in the Lattice of Partitions of a Set ⋮ On the lattice of maximum-sized antichains of a finite poset ⋮ 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 ⋮ An application of Dilworth's lattice of maximal antichains ⋮ The structure of Sperner k-families ⋮ Strong Sperner property of the subgroup lattice of an Abelian \(p\)-group ⋮ The Sperner property for posets: A probabilistic approach ⋮ A new proof of a theorem of Harper on the Sperner-Erdős problem
Cites Work
This page was built for publication: Maximal sized antichains in partial orders
