Optimal representations of partially ordered sets and a limit Sperner theorem

DOI10.1016/S0195-6698(86)80003-8zbMath0651.05014MaRDI QIDQ1106225

Konrad Engel

Publication date: 1986

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

variance; asymptotic formula; Sperner theory; Optimal representations; weighted partially ordered

Mathematics Subject Classification ID

06A06: Partial orders, general

05A99: Enumerative combinatorics

Related Items

Large antichains in the partition lattice, An asymptotic formula for the maximum size of an h-family in products of partially ordered sets, A new proof of a theorem of Harper on the Sperner-Erdős problem, The size of the largest antichain in the partition lattice

Cites Work

• An asymptotic formula for the maximum size of an h-family in products of partially ordered sets
• A new proof of a theorem of Harper on the Sperner-Erdős problem
• Product partial orders with the Sperner property
• The global theory of flows in networks
• The morphology of partially ordered sets
• Maximal sized antichains in partial orders
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• An inequality for the weights of two families of sets, their unions and intersections
• Normalized Matching in Direct Products of Partial Orders
• Some Results on Matching in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item