DeepAI AI Chat
Log In Sign Up

Asymptotic dimension of minor-closed families and beyond

by   Chun-Hung Liu, et al.
Texas A&M University

The asymptotic dimension of metric spaces is an important notion in geometric group theory introduced by Gromov. The metric spaces considered in this paper are the ones whose underlying spaces are the vertex-sets of graphs and whose metrics are the distance functions in graphs. A standard compactness argument shows that it suffices to consider the asymptotic dimension of classes of finite graphs. In this paper we prove that the asymptotic dimension of any minor-closed family, any class of graphs of bounded tree-width, and any class of graphs of bounded layered tree-width are at most 2, 1, and 2, respectively. The first result solves a question of Fujiwara and Papasoglu; the second and third results solve a number of questions of Bonamy, Bousquet, Esperet, Groenland, Pirot and Scott. These bounds for asymptotic dimension are optimal and improve a number of results in the literature. Our proofs can be transformed into linear or quadratic time algorithms for finding coverings witnessing the asymptotic dimension which is equivalent to finding weak diameter colorings for graphs. The key ingredient of our proof is a unified machinery about the asymptotic dimension of classes of graphs that have tree-decompositions of bounded adhesion over hereditary classes with known asymptotic dimension, which might be of independent interest.


page 1

page 2

page 3

page 4


Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces

The asymptotic dimension is an invariant of metric spaces introduced by ...

Minor-closed graph classes with bounded layered pathwidth

We prove that a minor-closed class of graphs has bounded layered pathwid...

Tree pivot-minors and linear rank-width

Tree-width and its linear variant path-width play a central role for the...

Unavoidable minors for graphs with large ℓ_p-dimension

A metric graph is a pair (G,d), where G is a graph and d:E(G) →R_≥0 is a...

Tree dimension in verification of constrained Horn clauses

In this paper, we show how the notion of tree dimension can be used in t...

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension

We propose to study unweighted graphs of constant distance VC-dimension ...

Local Dimension is Unbounded for Planar Posets

In 1981, Kelly showed that planar posets can have arbitrarily large dime...