Integer partitions and the Sperner property

DOI10.1016/S0304-3975(03)00235-4zbMath1070.68113OpenAlexW1980515882MaRDI QIDQ1885046

E. Rodney Canfield

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00235-4

zbMATH Keywords

Sperner propertyInteger partitionMatching problem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a continuous analog of Sperner's problem
• A simple counterexample to a conjecture of Rota
• The global theory of flows in networks
• The morphology of partially ordered sets
• On a problem of Rota
• The size of the largest antichain in the partition lattice
• An upper bound for the size of the largest antichain in the poset of partitions of an integer
• Maximal sized antichains in partial orders
• A decomposition theorem for partially ordered sets
• A Generalized Rota Conjecture for Partitions
• A connection between a convex programming problem and the LYM property on perfect graphs
• Asymptotic Methods in Enumeration
• Large antichains in the partition lattice
• On Representatives of Subsets
• Matchings in the Partition Lattice
• Stirling Behavior is Asymptotically Normal
• A generalization of Sperner's lemma
• Some Results on Matching in Bipartite Graphs
• AN ASYMPTOTIC FORMULA IN THE THEORY OF PARTITIONS
• SOME ASYMPTOTIC FORMULAE IN THE THEORY OF PARTITIONS (II)

This page was built for publication: Integer partitions and the Sperner property