Abstract: It has been known for 30 years that posets with bounded height and with cover graphs of bounded maximum degree have bounded dimension. Recently, Streib and Trotter proved that dimension is bounded for posets with bounded height and planar cover graphs, and Joret et al. proved that dimension is bounded for posets with bounded height and with cover graphs of bounded tree-width. In this paper, it is proved that posets of bounded height whose cover graphs exclude a fixed topological minor have bounded dimension. This generalizes all the aforementioned results and verifies a conjecture of Joret et al. The proof relies on the Robertson-Seymour and Grohe-Marx graph structure theorems.
Recommendations
Cites work
- A theory of recursive dimension of ordered sets
- Adjacency posets of planar graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Diameter and treewidth in minor-closed graph families
- Dimension and height for posets with planar cover graphs.
- Graph minors. XVI: Excluding a non-planar graph
- Graph minors. XX: Wagner's conjecture
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 3585462 (Why is no real title available?)
- scientific article; zbMATH DE number 3318595 (Why is no real title available?)
- Local tree-width, excluded minors, and approximation algorithms
- On the dimension of partially ordered sets
- On the dimension of posets with cover graphs of treewidth 2
- On the dimensions of ordered sets of bounded degree
- On-line dimension for posets excluding two long incomparable chains
- Partially Ordered Sets
- Posets with cover graph of pathwidth two have bounded dimension
- Sparsity and dimension
- Structure theorem and isomorphism test for graphs with excluded topological subgraphs
- The Complexity of the Partial Order Dimension Problem
- The dimension of planar posets
- Topological minors of cover graphs and dimension
- Tree-width and dimension
Cited in
(24)- Trees and circle orders
- Boolean dimension and local dimension
- Sparsity and dimension
- Dimension of posets with planar cover graphs excluding two long incomparable chains
- On the relative importance of excluded minors
- Excluding a small minor
- Excluding a ladder
- Tournament minors
- Planar posets that are accessible from below have dimension at most 6
- Dimension and height for posets with planar cover graphs
- scientific article; zbMATH DE number 6837054 (Why is no real title available?)
- Abnormal Minimizers
- Sparsity and dimension
- Topological minors of cover graphs and dimension
- Planar Posets Have Dimension at Most Linear in Their Height
- Minors for alternating dimaps
- Dimension and cut vertices: an application of Ramsey theory
- On covering numbers, Young diagrams, and the local dimension of posets
- Better bounds for poset dimension and boxicity
- Minors and dimension
- Dimension and matchings in comparability and incomparability graphs.
- Dimension is polynomial in height for posets with planar cover graphs
- Cover graphs and order dimension
- Forcing the wheel
This page was built for publication: Minors and dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345115)
