English

Bounds on Gromov Hyperbolicity Constant

Combinatorics 2015-03-05 v1 Metric Geometry

Abstract

If XX is a geodesic metric space and x1,x2,x3Xx_{1},x_{2},x_{3} \in X, a geodesic triangle T={x1,x2,x3}T=\{x_{1},x_{2},x_{3}\} is the union of the three geodesics [x1x2][x_{1}x_{2}], [x2x3][x_{2}x_{3}] and [x3x1][x_{3}x_{1}] in XX. The space XX is δ\delta-hyperbolic in the Gromov sense if any side of TT is contained in a δ\delta-neighborhood of the union of the two other sides, for every geodesic triangle TT in XX. If XX is hyperbolic, we denote by δ(X)\delta(X) the sharp hyperbolicity constant of XX, i.e. δ(X)=inf{δ0:0.3cm\delta(X) =\inf \{ \delta\geq 0:{0.3cm} X 0.2cm{0.2cm} is0.2cmδ-hyperbolic}.\text{is} {0.2cm} \delta \text{-hyperbolic} \}. To compute the hyperbolicity constant is a very hard problem. Then it is natural to try to bound the hyperbolycity constant in terms of some parameters of the graph. Denote by G(n,m)\mathcal{G}(n,m) the set of graphs GG with nn vertices and mm edges, and such that every edge has length 11. In this work we estimate A(n,m):=min{δ(G)GG(n,m)}A(n,m):=\min\{\delta(G)\mid G \in \mathcal{G}(n,m) \} and B(n,m):=max{δ(G)GG(n,m)}B(n,m):=\max\{\delta(G)\mid G \in \mathcal{G}(n,m) \}. In particular, we obtain good bounds for B(n,m)B(n,m), and we compute the precise value of A(n,m)A(n,m) for all values of nn and mm. Besides, we apply these results to random graphs.

Keywords

Cite

@article{arxiv.1503.01340,
  title  = {Bounds on Gromov Hyperbolicity Constant},
  author = {Veronica Hernandez and Domingo Pestana and Jose M. Rodriguez},
  journal= {arXiv preprint arXiv:1503.01340},
  year   = {2015}
}
R2 v1 2026-06-22T08:44:17.567Z