Better bounds for poset dimension and boxicity

Abstract

We prove that the dimension of every poset whose comparability graph has maximum degree $\hat{I}”$ is at most $\hat{I}”{\log }^{1+o(1)}\hat{I}”$. This result improves on a 30-year old bound of Füredi and Kahn, and is within a ${\log }^{o(1)}\hat{I}”$ factor of optimal. We prove this result via the notion of boxicity. The "boxicity" of a graph $G$ is the minimum integer $d$ such that $G$ is the intersection graph of $d$-dimensional axis-aligned boxes. We prove that every graph with maximum degree $\hat{I}”$ has boxicity at most $\hat{I}”{\log }^{1+o(1)}\hat{I}”$, which is also within a ${\log }^{o(1)}\hat{I}”$ factor of optimal. We also show that the maximum boxicity of graphs with Euler genus $g$ is $\hat{I}˜(\sqrt{g\log g})$, which solves an open problem of Esperet and Joret and is tight up to a $O(1)$ factor.