English

Large subposets with small dimension

Combinatorics 2014-04-02 v1

Abstract

Dorais asked for the maximum guaranteed size of a dimension dd subposet of an nn-element poset. A lower bound of order n\sqrt{n} was found by Goodwillie. We provide a sublinear upper bound for each dd. For d=2d=2, our bound is n0.8295n^{0.8295}.

Keywords

Cite

@article{arxiv.1404.0021,
  title  = {Large subposets with small dimension},
  author = {Benjamin Reiniger and Elyse Yeager},
  journal= {arXiv preprint arXiv:1404.0021},
  year   = {2014}
}

Comments

4 pages

R2 v1 2026-06-22T03:39:36.023Z