Substitution and atomic extension on greedy posets

DOI10.1007/BF00400287zbMATH Open0647.06001MaRDI QIDQ1104347FDOQ1104347

Authors: Jonathan Elbaz 

Publication date: 1986

Published in: Order (Search for Journal in Brave)

Recommendations

• On some new types of greedy chains and greedy linear extensions of partially ordered sets
• Greedy linear extensions for minimizing bumps
• Greedy posets for the bump-minimizing problem
• scientific article; zbMATH DE number 96384
• Greedy linear extensions to minimize jumps

zbMATH Keywords

substitutionjump numberatomic extensiongreedy posetssemi- partitive lattices

Mathematics Subject Classification ID

Partial orders, general (06A06)

Cites Work

• Title not available (Why is that?)
• A decomposition theorem for partially ordered sets
• Optimal Linear Extensions by Interchanging Chains
• Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
• Title not available (Why is that?)
• On finding the jump number of a partial order by substitution decomposition
• N-free posets as generalizations of series-parallel posets
• On the size of jump-critical ordered sets

This page was built for publication: Substitution and atomic extension on greedy posets

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