English

Dimension is polynomial in height for posets with planar cover graphs

Combinatorics 2022-10-13 v3 Discrete Mathematics

Abstract

We show that height hh posets that have planar cover graphs have dimension O(h6)\mathcal{O}(h^6). Previously, the best upper bound was 2O(h3)2^{\mathcal{O}(h^3)}. Planarity plays a key role in our arguments, since there are posets such that (1) dimension is exponential in height and (2) the cover graph excludes K5K_5 as a minor.

Keywords

Cite

@article{arxiv.1907.00380,
  title  = {Dimension is polynomial in height for posets with planar cover graphs},
  author = {Jakub Kozik and Piotr Micek and William T. Trotter},
  journal= {arXiv preprint arXiv:1907.00380},
  year   = {2022}
}
R2 v1 2026-06-23T10:07:52.327Z