Pages that link to "Item:Q2225405"

The following pages link to On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405):

Displaying 7 items.

• An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains (Q1124331) (← links)
• On-line dimension for posets excluding two long incomparable chains (Q1943697) (← links)
• Variants of online chain partition problem of posets (Q2851094) (← links)
• (Q3575997) (← links)
• Improved lower bound on the on-line chain partitioning of semi-orders with representation (Q6056742) (← links)
• Improved lower bounds on the on-line chain partitioning of posets of bounded dimension (Q6139864) (← links)
• (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE (Q6203557) (← links)