Tree-width and dimension
Combinatorics
2016-12-14 v3 Discrete Mathematics
Abstract
Over the last 30 years, researchers have investigated connections between dimension for posets and planarity for graphs. Here we extend this line of research to the structural graph theory parameter tree-width by proving that the dimension of a finite poset is bounded in terms of its height and the tree-width of its cover graph.
Keywords
Cite
@article{arxiv.1301.5271,
title = {Tree-width and dimension},
author = {Gwenaël Joret and Piotr Micek and Kevin G. Milans and William T. Trotter and Bartosz Walczak and Ruidong Wang},
journal= {arXiv preprint arXiv:1301.5271},
year = {2016}
}
Comments
Updates on solutions of problems and on bibliography