English

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

Combinatorics 2016-05-05 v4

Abstract

In 1977, Trotter and Moore proved that a poset has dimension at most 33 whenever its cover graph is a forest, or equivalently, has treewidth at most 11. On the other hand, a well-known construction of Kelly shows that there are posets of arbitrarily large dimension whose cover graphs have treewidth 33. In this paper we focus on the boundary case of treewidth 22. It was recently shown that the dimension is bounded if the cover graph is outerplanar (Felsner, Trotter, and Wiechert) or if it has pathwidth 22 (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 22. We show that it is indeed the case: Every such poset has dimension at most 12761276.

Keywords

Cite

@article{arxiv.1406.3397,
  title  = {On the dimension of posets with cover graphs of treewidth $2$},
  author = {Gwenaël Joret and Piotr Micek and William T. Trotter and Ruidong Wang and Veit Wiechert},
  journal= {arXiv preprint arXiv:1406.3397},
  year   = {2016}
}

Comments

v4: minor changes made following helpful comments by the referees