Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Dimension is polynomial in height for posets with planar cover graphs (1907.00380v3)

Published 30 Jun 2019 in math.CO and cs.DM

Abstract: We show that height $h$ posets that have planar cover graphs have dimension $\mathcal{O}(h6)$. Previously, the best upper bound was $2{\mathcal{O}(h3)}$. 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 $K_5$ as a minor.

Citations (7)

Summary

We haven't generated a summary for this paper yet.