Related papers: Gromov hyperbolicity of minor graphs

We study the question of approximating a compact geodesic metric space by metric graphs satisfying a uniform upper bound on their first Betti number. We prove that, up to a suitable multiplicative constant, Reeb graphs of distance functions…

Given a connected graph $G$, the metric (resp. edge metric) dimension of $G$ is the cardinality of the smallest ordered set of vertices that uniquely identifies every pair of distinct vertices (resp. edges) of $G$ by means of distance…

We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…

Let $\mathcal{F}_1$ and $\mathcal{F}_2$ be transverse two dimensional foliations with Gromov hyperbolic leaves in a closed 3-manifold $M$ whose fundamental group is not solvable, and let $\mathcal{G}$ be the one dimensional foliation…

Let $\widetilde{X}$ be a locally finite complete Gromov hyperbolic metric graph with the geometric boundary consisting of infinitely many points. Suppose that there is a discrete subgroup of the isometry group $Iso(\widetilde{X})$ acting…

A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained…

Let $\Gamma$ be a hyperbolic group and G be the isometry group of a Gromov-hyperbolic, properand geodesic metric space. We study the action of the outer automorphism group Out($\Gamma$) onthe set X($\Gamma$,G) of conjugacy classes of…

A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the…

The intricate relations between elements in natural and human-made systems sustain the complex processes that shape our world, forming multiscale networks of interactions. These networks can be represented as graphs composed of nodes…

We study the problem of finding, for a given one-dimensional topological space $X$, a cover of $X$ of smallest size by geodesics with respect to some metric. The infimal size of such a set is called the metric geodesic cover number of $X$.…

Let $Y$ be a subset of a metric space $X.$ We say that $Y$ is $\eta $-Gromov provided $Y$ is $\eta $-separated and not properly contained in any other $\eta $-separated subset of $X.$ In this paper, we review a result of Chew which says…

Hierarchically hyperbolic spaces provide a common framework for studying mapping class groups of finite type surfaces, Teichm\"uller space, right-angled Artin groups, and many other cubical groups. Given such a space $\mathcal X$, we build…

We show the equivalence of several characterizations of relative hyperbolicity for metric spaces, and obtain extra information about geodesics in a relatively hyperbolic space. We apply this to characterize hyperbolically embedded subgroups…

Consider a finite connected $2$-complex $X$ endowed with a piecewise Riemannian metric and whose fundamental group is freely indecomposable, of rank at least $3$, and in which every $2$-generated subgroup is free. In this paper we show that…

A hyperbolic group acts by homeomorphisms on its Gromov boundary. We use a dynamical coding of boundary points to show that such actions are topologically stable in the dynamical sense: any nearby action is semi-conjugate to (and an…

The connected tree-width of a graph is the minimum width of a tree-decomposition whose parts induce connected subgraphs. Long cycles are examples of graphs that have small tree-width but large connected tree-width. We show that a graph has…

We extend the theory of hyperbolicity of links in the 3-sphere to tg-hyperbolicity of virtual links, using the fact that the theory of virtual links can be translated into the theory of links living in closed orientable thickened surfaces.…

Markov's theorem classifies the worst irrational numbers with respect to rational approximation and the indefinite binary quadratic forms whose values for integer arguments stay farthest away from zero. The main purpose of this paper is to…

We give a combinatorial proof, using the hyperbolicity of the curve graphs, of the bounded geodesic image theorem of Masur and Minsky. Recently it has been shown that curve graphs are uniformly hyperbolic, thus a universal bound can be…

To compute the hyperbolicity constant is an almost intractable problem, thus it is natural to try to bound it in terms of some parameters of the graph. Let $\mathcal{G}(g,c,n)$ be the set of graphs $G$ with girth $g(G)=g$, circumference…