A solution of the Sperner-Erdős problem

DOI10.1016/0304-3975(82)90091-3zbMath0498.90027MaRDI 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

poset; combinatorial optimization; polynomial time algorithm; k-chain; Maxflow problem; series of polynomial reductions; Sperner set of order k; Sperner-Erdős problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

90B10: Deterministic network models in operations research

05C38: Paths and cycles