Pages that link to "Item:Q1753118"

The following pages link to An easy subexponential bound for online chain partitioning (Q1753118):

Displaying 3 items.

• On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
• A Dichotomy Theorem for First-Fit Chain Partitions (Q5218437) (← links)
• Improved lower bound on the on-line chain partitioning of semi-orders with representation (Q6056742) (← links)