Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces
From MaRDI portal
Publication:6582315
DOI10.4171/jems/1341zbMATH Open1545.20035MaRDI QIDQ6582315
Carla Groenland, Chun-Hung Liu, Marthe Bonamy, Nicolas Bousquet, François Pirot, Alexander D. Scott, Louis Esperet
Publication date: 2 August 2024
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Geometric group theory (20F65) Metric spaces, metrizability (54E35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph minors (05C83)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- Graph minors. XX: Wagner's conjecture
- On exactness and isoperimetric profiles of discrete groups
- Asymptotic dimension
- Graph minors. V. Excluding a planar graph
- Graphs drawn with few crossings per edge
- Random walk in random groups.
- Partitioning into graphs with only small components
- Graph minors. XVI: Excluding a non-planar graph
- Defective and clustered graph colouring
- Universal spaces for asymptotic dimension
- On the separation profile of infinite graphs
- On the bi-Lipschitz geometry of lamplighter graphs
- Layered separators in minor-closed graph classes with applications
- Strongly Sublinear Separators and Polynomial Expansion
- A continuum of expanders
- Map graphs
- A Hurewicz-type theorem for asymptotic dimension and applications to geometric group theory
- A Hurewicz theorem for the Assouad-Nagata dimension
- Intrinsic Differential Geometry and the Existence of Quasimeromorphic Mappings
- Universal approximations for TSP, Steiner tree, and set cover
- Orthogonal Tree Decompositions of Graphs
- Geodesic spaces of low Nagata dimension
- Asymptotic dimension of planes and planar graphs
- Metric dimensions of minor excluded graphs and minor exclusion in groups
- Structure of Graphs with Locally Restricted Crossings
- Choice functions and Tychonoff’s theorem
- The intrinsic dimensionality of graphs
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components
- Separating layered treewidth and row treewidth
Related Items (2)
Lipschitz extension theorems with explicit constants ⋮ Clustered coloring of graphs with bounded layered treewidth and bounded degree
This page was built for publication: Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces
