Dimension is polynomial in height for posets with planar cover graphs
From MaRDI portal
Publication:6187346
DOI10.1016/j.jctb.2023.10.009zbMath1530.05034arXiv1907.00380OpenAlexW2955178648MaRDI QIDQ6187346
Jakub Kozik, Piotr Micek, William T. jun. Trotter
Publication date: 15 January 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.00380
Combinatorics of partially ordered sets (06A07) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Minors and dimension
- Colouring graphs with bounded generalized colouring number
- The dimension of planar posets
- Chromatic numbers of exact distance graphs
- Sparsity and dimension
- Orderings on graphs and game coloring number
- Improved bounds for weak coloring numbers
- Nowhere dense graph classes and dimension
- Tree-width and dimension
- On the dimension of posets with cover graphs of treewidth 2
- Dimension and height for posets with planar cover graphs.
- Topological Minors of Cover Graphs and Dimension
- Planar Posets Have Dimension at Most Linear in Their Height
- Partially Ordered Sets
- On the dimension of partially ordered sets
- On the generalised colouring numbers of graphs that exclude a fixed minor
This page was built for publication: Dimension is polynomial in height for posets with planar cover graphs