The size of the largest antichain in the partition lattice

DOI10.1006/jcta.1998.2871zbMath0908.05008OpenAlexW2066116816MaRDI QIDQ1269889

E. Rodney Canfield

Publication date: 18 March 1999

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

Full work available at URL: https://semanticscholar.org/paper/6ff9bf197aae9f8c514afeb3bf5c4b82ff65ebe5

zbMATH Keywords

antichainStirling numberSperner theoryregular posetposet of partitions

Mathematics Subject Classification ID

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

Related Items (6)

Integer partitions and the Sperner property ⋮ Chains, antichains, and complements in infinite partition lattices ⋮ A lazy approach to symmetry reduction ⋮ Morphisms for resistive electrical networks ⋮ The restricted partition lattices ⋮ The symmetric group, ordered by refinement of cycles, is strongly Sperner

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a continuous analog of Sperner's problem
• Optimal representations of partially ordered sets and a limit Sperner theorem
• A simple counterexample to a conjecture of Rota
• On a problem of Rota
• Independent process approximations for random combinatorial structures
• Random set partitions: Asymptotics of subset counts
• On Rota's problem concerning partitions
• Maximal sized antichains in partial orders
• A counterexample to the generalisation of Sperner's theorem
• Large antichains in the partition lattice
• Stirling Behavior is Asymptotically Normal
• A generalization of Sperner's lemma
• Some Results on Matching in Bipartite Graphs

This page was built for publication: The size of the largest antichain in the partition lattice