A new proof of a theorem of Harper on the Sperner-Erdős problem

DOI10.1016/0097-3165(85)90079-2zbMath0576.05001OpenAlexW2095113088MaRDI QIDQ1065006

Konrad Engel

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0097-3165(85)90079-2

zbMATH Keywords

linear programmingranked posetweighted posetsSperner familiesHarper's theoremrelation graphs of posets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (1)

Optimal representations of partially ordered sets and a limit Sperner theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal representations of partially ordered sets and a limit Sperner theorem
• A short proof of the existence of k-saturated partitions of partially ordered sets
• The global theory of flows in networks
• Maximal sized antichains in partial orders
• Blocking and anti-blocking pairs of polyhedra
• The structure of Sperner k-families

This page was built for publication: A new proof of a theorem of Harper on the Sperner-Erdős problem