Computing the hyperbolicity constant (Q2429111): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: José M. Rodríguez / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Igor G. Nikolaev / rank | |||
Normal rank |
Revision as of 08:02, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing the hyperbolicity constant |
scientific article |
Statements
Computing the hyperbolicity constant (English)
0 references
22 April 2012
0 references
If \(X\) is Gromov's \(\delta \)-hyperbolic space, then the hyperbolicity constant of \(X\) is \(\inf\{\delta \geq 0: X\text{ is }\delta \text{-hyperbolic}\}\). The authors study graphs with edges of the same length \(k\). If \(G\) is such graph, then \(J(G)\) denotes the union of the set \(V(G)\) of vertices of \(G\) and the midpoints of the edges of \(G\). Let \(T_1\) denote the set of all geodesic triangles with vertices in \(J(G)\) and which are simple cycles (i.e., simple closed curves). Then \(\delta_1(T)=\inf \{\lambda \geq 0:\text{ every triangle }T\in T_1\text{ is }\lambda \text{-thin}\}\). The main result of the paper states that for every graph \(G\) with edges of equal length \(k\), \(\delta_1(G)=\delta (G)\). In addition, it is shown that the hyperbolicity constant \(\delta(G)\) is a multiple of \(k/4\). As a corollary, the authors derive that for every hyperbolic graph \(G\) with edges of length \(k\), there is a triangle \(T\in T_1\) for which the hyperbolicity constant is attained.
0 references
graph
0 references
geodesic metric space
0 references
triangle
0 references
hyperbolic space
0 references
hyperbolicity constant
0 references