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

DOI10.1016/0097-3165(85)90079-2MaRDI QIDQ1065006zbMATH OpenOpenAlexFDO

Authors 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 programmingSperner familiesHarper's theoremranked posetrelation graphs of posetsweighted posets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Recommendations

• scientific article; zbMATH DE number 3851159
• Optimal representations of partially ordered sets and a limit Sperner theorem
• scientific article; zbMATH DE number 1016362
• scientific article; zbMATH DE number 937456
• scientific article; zbMATH DE number 3877243

Cites work

• scientific article; zbMATH DE number 3828714 (Why is no real title available?)
• scientific article; zbMATH DE number 3636041 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• A short proof of the existence of k-saturated partitions of partially ordered sets
• Blocking and anti-blocking pairs of polyhedra
• Maximal sized antichains in partial orders
• Optimal representations of partially ordered sets and a limit Sperner theorem
• The global theory of flows in networks
• The structure of Sperner k-families

Cited in

(3)

• Optimal representations of partially ordered sets and a limit Sperner theorem
• Morphisms for the strong Sperner property of Stanley and Griggs
• On weighted kernels of two posets.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065006)