arXiv Analytics

Sign in

arXiv:1406.3397 [math.CO]AbstractReferencesReviewsResources

On the dimension of posets with cover graphs of treewidth $2$

Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert

Published 2014-06-13, updated 2014-10-03Version 2

In 1977, Trotter and Moore proved that a poset has dimension at most $3$ whenever its cover graph is a forest, or equivalently, has treewidth at most $1$. On the other hand, a well-known construction of Kelly shows that there are posets of arbitrarily large dimension whose cover graphs have treewidth $3$. In this paper we focus on the boundary case of treewidth $2$. It was recently shown that the dimension is bounded if the cover graph is outerplanar (Felsner, Trotter, and Wiechert) or if it has pathwidth $2$ (Bir\'o, Keller, and Young). This can be interpreted as evidence that the dimension should be bounded more generally when the cover graph has treewidth $2$. We show that it is indeed the case: Every such poset has dimension at most $2554$.

Related articles: Most relevant | Search more
arXiv:1308.4877 [math.CO] (Published 2013-08-22, updated 2015-01-29)
Posets with cover graph of pathwidth two have bounded dimension
arXiv:2308.11950 [math.CO] (Published 2023-08-23)
Cliquewidth and dimension
arXiv:1610.00809 [math.CO] (Published 2016-10-04)
The 1/3-2/3 Conjecture for ordered sets whose cover graph is a forest