Tree-width and dimension
classification
🧮 math.CO
cs.DM
keywords
dimensiontree-widthgraphboundedconnectionscoverextendfinite
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.