English

Planarity and dimension I

Combinatorics 2025-12-19 v2

Abstract

The dimension of a partially ordered set PP (poset for short) is the least positive integer dd such that PP is isomorphic to a subposet of Rd\mathbb{R}^d with the natural product order. Dimension is arguably the most widely studied measure of complexity for posets, and standard examples in posets are the canonical structure forcing dimension to be large. In many ways, dimension for posets is analogous to chromatic number for graphs with standard examples in posets playing the role of cliques in graphs. However, planar graphs have chromatic number at most four, while posets with planar diagrams may have arbitrarily large dimension. The key feature of all known constructions of such posets is that large dimension is forced by a large standard example. The question of whether every poset of large dimension and with a planar cover graph contains a large standard example has been a critical challenge in posets theory since the early 1980s, with very little progress over the years. We answer the question in the affirmative. Namely, we show that every poset PP with a planar cover graph has dimension O(s8)\mathcal{O}(s^8), where ss is the maximum order of a standard example in PP.

Keywords

Cite

@article{arxiv.2510.18603,
  title  = {Planarity and dimension I},
  author = {Heather Smith Blake and Jędrzej Hodor and Piotr Micek and Michał T. Seweryn and William T. Trotter},
  journal= {arXiv preprint arXiv:2510.18603},
  year   = {2025}
}

Comments

103 pages, minor fixes

R2 v1 2026-07-01T06:57:50.612Z