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

DOI10.1016/0097-3165(85)90079-2zbMATH Open0576.05001OpenAlexW2095113088MaRDI QIDQ1065006FDOQ1065006

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

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

zbMATH Keywords

linear programmingSperner familiesHarper's theoremranked posetrelation graphs of posetsweighted posets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Blocking and anti-blocking pairs of polyhedra
• A short proof of the existence of k-saturated partitions of partially ordered sets
• The structure of Sperner k-families
• Optimal representations of partially ordered sets and a limit Sperner theorem
• Title not available (Why is that?)
• Maximal sized antichains in partial orders
• The global theory of flows in networks

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)