Minors and dimension
From MaRDI portal
Publication:345115
DOI10.1016/J.JCTB.2016.09.001zbMATH Open1350.05159arXiv1407.4066OpenAlexW1692549677MaRDI QIDQ345115FDOQ345115
Authors: Bartosz Walczak 
Publication date: 25 November 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1407.4066
Recommendations
Cites Work
- Graph minors. XX: Wagner's conjecture
- Approximation algorithms for NP-complete problems on planar graphs
- A theory of recursive dimension of ordered sets
- The Complexity of the Partial Order Dimension Problem
- Title not available (Why is that?)
- Partially Ordered Sets
- The dimension of planar posets
- Tree-width and dimension
- Title not available (Why is that?)
- Adjacency posets of planar graphs
- On the dimension of posets with cover graphs of treewidth 2
- Dimension and height for posets with planar cover graphs.
- Posets with cover graph of pathwidth two have bounded dimension
- Title not available (Why is that?)
- Topological minors of cover graphs and dimension
- On the dimension of partially ordered sets
- Diameter and treewidth in minor-closed graph families
- On the dimensions of ordered sets of bounded degree
- Graph minors. XVI: Excluding a non-planar graph
- On-line dimension for posets excluding two long incomparable chains
- Local tree-width, excluded minors, and approximation algorithms
- Sparsity and dimension
- Structure theorem and isomorphism test for graphs with excluded topological subgraphs
Cited In (21)
- Minors for alternating dimaps
- On covering numbers, Young diagrams, and the local dimension of posets
- Tournament minors
- Minors and dimension
- Dimension and matchings in comparability and incomparability graphs.
- Planar Posets Have Dimension at Most Linear in Their Height
- Dimension is polynomial in height for posets with planar cover graphs
- Planar posets that are accessible from below have dimension at most 6
- Excluding a small minor
- On the relative importance of excluded minors
- Topological minors of cover graphs and dimension
- Trees and circle orders
- Better bounds for poset dimension and boxicity
- Abnormal Minimizers
- Title not available (Why is that?)
- Boolean dimension and local dimension
- Sparsity and dimension
- Dimension of posets with planar cover graphs excluding two long incomparable chains
- Excluding a ladder
- Sparsity and dimension
- Dimension and cut vertices: an application of Ramsey theory
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)
