Dimension is polynomial in height for posets with planar cover graphs
Jakub Kozik, Piotr Micek, and William T. Trotter

TL;DR
This paper proves that posets with planar cover graphs have polynomial dimension in terms of height, significantly improving previous exponential bounds, with planarity being a crucial factor in the analysis.
Contribution
It establishes a polynomial upper bound on the dimension of height h posets with planar cover graphs, advancing understanding of poset dimension constraints.
Findings
Dimension is polynomial in height for such posets
Planarity is essential for the polynomial bound
Exponential dimension can occur without planarity
Abstract
We show that height posets that have planar cover graphs have dimension . Previously, the best upper bound was . 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 as a minor.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Limits and Structures in Graph Theory
