A Dichotomy Theorem for First-Fit Chain Partitions

First-Fit is a greedy algorithm for partitioning the elements of a poset into chains. Let $\mathrm{FF}(w,Q)$ be the maximum number of chains that First-Fit uses on a $Q$-free poset of width $w$. A ...