On the size of jump-critical ordered sets

DOI10.1007/BF00396268zbMath0559.06004OpenAlexW2055962008WikidataQ71385563 ScholiaQ71385563MaRDI QIDQ802585

Mohamed H. El-Zahar, James H. Schmerl

Publication date: 1984

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00396268

zbMATH Keywords

finite posetlinear extensionsjump-critical ordered setnumber of jumps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Combinatorial inequalities (05A20)

Related Items

On the poset of all posets on \(n\) elements, Minimizing bumps in linear extensions of ordered sets, NP-completeness results concerning greedy and super greedy linear extensions, Greedy posets for the bump-minimizing problem, FPT Suspects and Tough Customers: Open Problems of Downey and Fellows, Substitution and atomic extension on greedy posets, On the Jump Number of Lexicographic Sums of Ordered Sets, Jump number problem: The role of matroids, Greedy linear extensions to minimize jumps, An improved algorithm for the jump number problem, Examples of Jump-Critical Ordered Sets

Cites Work

• A decomposition theorem for partially ordered sets
• Optimal Linear Extensions by Interchanging Chains
• The Jump Number of Dags and Posets: An Introduction