Related papers: Asymptotic dimensions of the arc graphs and disk g…

We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…

We show that the asymptotic dimension of a hyperbolic relatively hyperbolic graph is finite provided that this holds true uniformly for the peripheral subgraphs and for the electrifiation. We use this to show that the asymptotic dimension…

We present lower and upper bounds for the geometric-arithmetic index of unicyclic graphs and provide extremal graphs for the corresponding bounds.

Bonamy et al \cite{BBEGLPS} showed that graphs of polynomial growth have finite asymptotic dimension. We refine their result showing that a graph of polynomial growth strictly less than $n^{k+1}$ has asymptotic dimension at most $k$. As a…

In this note we give asymptotic estimates for the volume growth associated to suitable infinite graphs. Our main application is to give an asymptotic estimate for volume growth associated to translation surfaces.

We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree $d$. We completely determine the asymptotic behaviour…

Let $\Sigma$ be a compact, orientable surface of genus $g$, and let $\Gamma$ be a relation on $\pi_0(\partial \Sigma)$ such that the prescribed arc graph $\mathcal{A}(\Sigma,\Gamma)$ is Gromov-hyperbolic and non-trivial. We show that…

We show that the asymptotic dimension of a geodesic space that is homeomorphic to a subset in the plane is at most three. In particular, the asymptotic dimension of the plane and any planar graph is at most three.

For a 3-manifold M and a subsurface $X$ of the boundary of M with empty or incompressible boundary we use surgery to identify a graph whose vertices are disks with boundary in X and which is quasi-isometrically embedded in the curve graph…

We prove the existence of an upper bound on the asymptotic dimension of tree amalgamations of locally finite quasi-transitive connected graphs. This generalises a result of Dranishnikov for free products with amalgamation and a result of…

We show that intersection graphs of compact convex sets in R^n of bounded aspect ratio have asymptotic dimension at most 2n+1. More generally, we show this is the case for intersection graphs of systems of subsets of any metric space of…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

We give the asymptotic growth of the number of (multi-)arcs of bounded length between boundary components on complete finite-area hyperbolic surfaces with boundary. Specifically, if $S$ has genus $g$, $n$ boundary components and $p$…

This article presents the precise asymptotical distribution of two types of critical transmission radii, defined in terms of $k-$connectivity and the minimum vertex degree, for a random geometry graph distributed over a unit-volume region…

We prove a formula for the asymptotic number of edge-colored regular graphs with a prescribed set of allowed vertex-incidence structures. The formula depends on specific critical points of a polynomial encoding the vertex-incidences. As an…

In this paper it is proved that there are constants 0< c_2< c_1 such that an asymptotic formula can be given for the the number of (labeled) n-vertex graphs of diameter d whenever n tends to infinity and 2 < d < n - c_1 (log n). A typical…

We give a bound, linear in the complexity of the surface, on the asymptotic dimension of the curve complex as well as the capacity dimension of the ending lamination space.

We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…

We find asymptotics of the maximum size of a chordal subgraph in a binomial random graph $G(n,p)$, for $p=\mathrm{const}$ and $p=n^{-\alpha+o(1)}$.

Explicit formulae for asymptotic expansions of Feynman diagrams in typical limits of momenta and masses with external legs on the mass shell are presented.