Pages that link to "Item:Q3976789"
From MaRDI portal
The following pages link to Bounds for the jump number of partially ordered sets (Q3976789):
Displaying 14 items.
- NP-completeness properties about linear extensions (Q581427) (← links)
- The jump number of suborders of the power set order (Q583248) (← links)
- On the size of jump-critical ordered sets (Q802585) (← links)
- The jump number and the lattice of maximal antichains (Q807648) (← links)
- Chain dominated orders (Q862975) (← links)
- A 3/2-approximation algorithm for the jump number of interval orders (Q921022) (← links)
- Greedy linear extensions to minimize jumps (Q1061150) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- On minimizing jumps for ordered sets (Q1177708) (← links)
- An optimal algorithm to find the jump number of partially ordered sets (Q1366304) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- Estimates for \(F\)-jumping numbers and bounds for Hartshorne-Speiser-Lyubeznik numbers (Q2840046) (← links)
- Jumps of Hemimaximal Sets (Q3982858) (← links)
- (Q4528061) (← links)