首页 | 本学科首页   官方微博 | 高级检索  
     


On the Dimension of Posets with Cover Graphs of Treewidth 2
Authors:Gwenaël Joret  Piotr Micek  William T. Trotter  Ruidong Wang  Veit Wiechert
Affiliation:1.Computer Science Department,Université Libre de Bruxelles,Brussels,Belgium;2.Theoretical Computer Science Department, Faculty of Mathematics and Computer Science,Jagiellonian University,Kraków,Poland;3.School of Mathematics,Georgia Institute of Technology,Atlanta,USA;4.Institut für Mathematik,Technische Universit?t,Berlin,Germany
Abstract: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ó, 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 1276.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号