• Citer

First-Fit is linear on posets excluding two long incomparable chains

par Joret, Gwenaël ;Milans, Kevin G.
Référence Order, 28, 3, page (455--464)
Publication Publié, 2011

Article révisé par les pairs

• Détails
• Contenu

Résumé :

A poset is (r + s)-free if it does not contain two incomparable chains of size r and s, respectively. We prove that when r and s are at least 2, the First-Fit algorithm partitions every (r + s)-free poset P into at most 8(r - 1)(s - 1)w chains, where w is the width of P. This solves an open problem of Bosek et al. (SIAM J Discrete Math 23(4):1992-1999, 2010). © 2010 Springer Science+Business Media B.V.