Related papers: Asymptotic dimension of multi-ended quasi-transiti…

It is proven that if a finitely presented group is one ended it has asymptotic dimension bigger than one. It follows that finitely presented groups with asdim 1 are virtually free. A counterexample is given for the finitely generated case.

This study delves into the exploration of the limiting shape theorem for subadditive processes on finitely generated groups with polynomial growth, commonly referred to as virtually nilpotent groups. Investigating the algebraic structures…

We obtain two in a sense dual to each other results: First, that the capacity dimension of every compact, locally self-similar metric space coincides with the topological dimension, and second, that the asymptotic dimension of a metric…

For the right-angled Artin group action on the extension graph, it is known that the minimal asymptotic translation length is bounded above by 2 provided that the defining graph has diameter at least 3. In this paper, we show that the same…

Suppose that a finitely generated group $G$ is hyperbolic relative to a collection of subgroups $\{H_1, ..., H_m\} $. We prove that if each of the subgroups $H_1, ..., H_m$ has finite asymptotic dimension, then asymptotic dimension of $G$…

In an early work from 1896, Maschke established the complete list of all finite planar Cayley graphs. This result initiated a long line of research over the next century, aiming at characterizing in a similar way all planar infinite Cayley…

We show that a relatively hyperbolic group quasi-isometrically embeds in a product of finitely many trees if the peripheral subgroups do, and we provide an estimate on the minimal number of trees needed. Applying our result to the case of…

We prove that the saddle connection graph associated to any half-translation surface is 4-hyperbolic and uniformly quasi-isometric to the regular countably infinite-valent tree. Consequently, the saddle connection graph is not…

Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…

We develop a method to bound the dynamic asymptotic dimension of isometric group actions $\Gamma\curvearrowright X$ in terms of the asymptotic dimension of a space of graphs similar to a box space of $\Gamma$ (which also determines…

Asymptotic property C for metric spaces was introduced by Dranishnikos as generalization of finite asymptotic dimension - asdim. It turns out that this property can be viewed as transfinite extension of asymptotic dimension. The original…

We deal with a general preferential attachment graph model with multiple type edges. The types are chosen randomly, in a way that depends on the evolution of the graph. In the $N$-type case, we define the (generalized) degree of a given…

Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We…

In this paper, we develop a coarse analogue of treewidth. We prove that a graph $G$ admits a tree-decomposition in which each bag is contained in the union of a bounded number of balls of bounded radius, if and only if $G$ admits a…

We prove that the linearly controlled asymptotic dimension of the fundamental group of any 3-dimensional graph-manifold does not exceed 7. As applications we obtain that the universal cover of such a graph-manifold is an absolute Lipschitz…

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes…

Let $G$ be a finite connected graph on two or more vertices and $G^{[N,k]}$ the distance $k$-graph of the $N$-fold Cartesian power of $G$. For a fixed $k\ge1$, we obtain explicitly the large $N$ limit of the spectral distribution (the…

I compute several terms of the asymptotic expansion of the number of connected labelled graphs with n nodes and m edges, for small k=m-n.

We prove that all hierarchically hyperbolic spaces have finite asymptotic dimension and obtain strong bounds on these dimensions. One application of this result is to obtain the sharpest known bound on the asymptotic dimension of the…