The jump number of suborders of the power set order

DOI10.1007/BF00341640zbMATH Open0692.06002OpenAlexW2013876096MaRDI QIDQ583248FDOQ583248

Sumit K. Garg, Jianyong Qiao

Publication date: 1989

Published in: Order (Search for Journal in Brave)

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

Recommendations

• scientific article; zbMATH DE number 19350
• Greedy linear extensions to minimize jumps
• Examples of Jump-Critical Ordered Sets
• On the size of jump-critical ordered sets
• On the Jump Number of Lexicographic Sums of Ordered Sets

zbMATH Keywords

jump numberlinear extension of an ordered setoptimal linear extensionpower set orderreverse lexicographic ordering

Mathematics Subject Classification ID

Partial orders, general (06A06) Total orders (06A05)

Cites Work

• An extremal problem for two families of sets
• Intersection patterns of convex sets
• The module structure of integral designs
• Setup optimization problems with matroid structure
• Minimizing Setups for Ordered Sets: A Linear Algebraic Approach

Cited In (6)

• Power-ordered sets
• Boolean layer cakes
• On the Jump Number of Lexicographic Sums of Ordered Sets
• Title not available (Why is that?)
• Largest induced suborders satisfying the chain condition
• Jumps of Orderings

This page was built for publication: The jump number of suborders of the power set order

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