A solution of the Sperner-Erdős problem

DOI10.1016/0304-3975(82)90091-3zbMath0498.90027OpenAlexW2005989716MaRDI QIDQ1171500

S. Singh

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90091-3

zbMATH Keywords

posetcombinatorial optimizationpolynomial time algorithmk-chainMaxflow problemseries of polynomial reductionsSperner set of order kSperner-Erdős problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Paths and cycles (05C38)

Related Items (2)

Optimal channel allocation for several types of cellular radio networks ⋮ The global theory of paths in networks. I: Definitions, examples and limits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof of the existence of k-saturated partitions of partially ordered sets
• The global theory of flows in networks
• The morphology of partially ordered sets
• A method and two algorithms on the theory of partitions
• Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
• On a lemma of Littlewood and Offord

This page was built for publication: A solution of the Sperner-Erdős problem