An easy subexponential bound for online chain partitioning

Bartłomiej Bosek, Tomasz Krawczyk, Henry Kierstead, Grzegorz Matecki, Matthew E. Smith

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


Bosek and Krawczyk exhibited an online algorithm for partitioning an online poset of width w into w141gw chains. We improve this to w6.51g w+7 with a simpler and shorter proof by combining the work of Bosek & Krawczyk with work of Kierstead & Smith on First-Fit chain partitioning of ladder-free posets. We also provide examples illustrating the limits of our approach.

Original languageEnglish (US)
Article number#P2.28
JournalElectronic Journal of Combinatorics
Issue number2
StatePublished - May 25 2018


  • First-fit
  • Ladder
  • Online chain partition
  • Partially ordered set
  • Poset
  • Regular poset

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'An easy subexponential bound for online chain partitioning'. Together they form a unique fingerprint.

Cite this