An Easy Subexponential Bound for Online Chain Partitioning

Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith. An Easy Subexponential Bound for Online Chain Partitioning. Electr. J. Comb., 25(2):2, 2018. [doi]

@article{BosekKKMS18,
  title = {An Easy Subexponential Bound for Online Chain Partitioning},
  author = {Bartlomiej Bosek and Hal A. Kierstead and Tomasz Krawczyk and Grzegorz Matecki and Matthew E. Smith},
  year = {2018},
  url = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p28},
  researchr = {https://researchr.org/publication/BosekKKMS18},
  cites = {0},
  citedby = {0},
  journal = {Electr. J. Comb.},
  volume = {25},
  number = {2},
  pages = {2},
}