Abstract:The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. When restricted to graphs and their shortest paths metric, the asymptotic dimension can be seen as a large scale version of weak diameter colourings (also known as weak diameter network decompositions), i.e. colourings in which each monochromatic component has small weak diameter.In this paper, we prove that for any p, the class of graphs excluding K3,p as a minor has asymptotic dimension at… Show more
“…Bonamy et al [1] proved that all locally finite Cayley graphs of finitely generated groups of asymptotic dimension at least 3 are not minor excluded, moreover from their discussion follows that all quasi-transitive locally finite graphs of asymptotic dimension at least 3 are not minor excluded. On the other side, quasi-transitive locally finite graph that are quasi-isometric to trees have asymptotic dimension 1.…”
In this note, we show that locally finite quasi-transitive graphs are quasi-isometric to trees if and only if every other locally finite quasi-transitive graph quasi-isometric to them is minor excluded. This generalizes results by Ostrovskii and Rosenthal and by Khukhro on minor exclusion for groups.
“…Bonamy et al [1] proved that all locally finite Cayley graphs of finitely generated groups of asymptotic dimension at least 3 are not minor excluded, moreover from their discussion follows that all quasi-transitive locally finite graphs of asymptotic dimension at least 3 are not minor excluded. On the other side, quasi-transitive locally finite graph that are quasi-isometric to trees have asymptotic dimension 1.…”
In this note, we show that locally finite quasi-transitive graphs are quasi-isometric to trees if and only if every other locally finite quasi-transitive graph quasi-isometric to them is minor excluded. This generalizes results by Ostrovskii and Rosenthal and by Khukhro on minor exclusion for groups.
“…Ostrovskii and Rosenthal [15] proved a bound depending on the graph H: for every graph H, the class of H-minor free graphs has asymptotic dimension at most 4 |V (H)| − 1. Bonamy, Bousquet, Esperet, Groenland, Pirot and Scott [5] proved the case for bounded maximum degree graphs: for every integer ∆ and graph H, the class of H-minor free graphs of maximum degree at most ∆ has asymptotic dimension at most 2. Bonamy et al [5] used their result to answer a question of Ostrovskii and Rosenthal [15] by showing that for every finitely generated group Γ with a symmetric finite generating set S, if there exists a graph H such that H is not a minor of the Cayley graph for (Γ, S), then the asymptotic dimension of the Cayley graph for (Γ, S) is at most 2.…”
Section: Introductionmentioning
confidence: 99%
“…Bonamy, Bousquet, Esperet, Groenland, Pirot and Scott [5] proved the case for bounded maximum degree graphs: for every integer ∆ and graph H, the class of H-minor free graphs of maximum degree at most ∆ has asymptotic dimension at most 2. Bonamy et al [5] used their result to answer a question of Ostrovskii and Rosenthal [15] by showing that for every finitely generated group Γ with a symmetric finite generating set S, if there exists a graph H such that H is not a minor of the Cayley graph for (Γ, S), then the asymptotic dimension of the Cayley graph for (Γ, S) is at most 2. Bonamy et al [5] also proved the case H = K 3,t for every positive integer t and the case that H is an apex-forest in Question 1.1.…”
Section: Introductionmentioning
confidence: 99%
“…Bonamy et al [5] used their result to answer a question of Ostrovskii and Rosenthal [15] by showing that for every finitely generated group Γ with a symmetric finite generating set S, if there exists a graph H such that H is not a minor of the Cayley graph for (Γ, S), then the asymptotic dimension of the Cayley graph for (Γ, S) is at most 2. Bonamy et al [5] also proved the case H = K 3,t for every positive integer t and the case that H is an apex-forest in Question 1.1.…”
Section: Introductionmentioning
confidence: 99%
“…[5]. It also solves a question [5,Question 9] about the difference between forbidding minors and forbidding "fat minors" and a question [5,Question 5] about forbidding K s,t -minors in a strong sense. Theorem 1.2.…”
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.
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 proper 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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.