Results 111 to 120 of about 353 (136)
Some of the next articles are maybe not open access.
Teichmüller’s problem for Gromov hyperbolic domains
Israel Journal of Mathematics, 202222 ...
Zhou, Qingshan, Rasila, Antti
openaire +2 more sources
Gromov hyperbolicity of Johnson and Kneser graphs
Aequationes MathematicaeThe concept of Gromov hyperbolicity is a geometric concept that leads to a rich general theory. Johnson and Kneser graphs are interesting combinatorial graphs defined from systems of sets.
Rosalio Reyes +2 more
exaly +2 more sources
Gromov hyperbolicity of the Hilbert distance
Annals of Global Analysis and Geometry, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fathi Haggui, Houcine Guermazi
openaire +2 more sources
Scaled Gromov hyperbolic graphs
Journal of Graph Theory, 2007AbstractIn this article, the δ‐hyperbolic concept, originally developed for infinite graphs, is adapted to very large but finite graphs. Such graphs can indeed exhibit properties typical of negatively curved spaces, yet the traditional δ‐hyperbolic concept, which requires existence of an upper bound on the fatness δ of the geodesic triangles, is unable
Edmond A. Jonckheere +2 more
openaire +1 more source
Pseudoconvexity and Gromov hyperbolicity
Comptes Rendus de l'Académie des Sciences - Series I - Mathematics, 1999The authors give an estimate for the distance functions related to the Bergman, Carathéodory and Kobayashi metrics on a bounded strictly pseudoconvex domain with \(C^{2}\)-smooth boundary. This estimate relates the distance function on the domain with the Carnot-Carathéodory metric on the boundary.
Balogh, Zoltan M., Bonk, Mario
openaire +2 more sources
Applying clique-decomposition for computing Gromov hyperbolicity
Theoretical Computer Science, 2017 International audienceGiven a graph, its hyperbolicity is a measure of how close its distance distribution is to the one of a tree. This parameter has gained recent attention in the analysis of some graph algorithms and the classification of complex ...
David Coudert, Guillaume Ducoffe
exaly +3 more sources
THE HILBERT METRIC AND GROMOV HYPERBOLICITY
2002Given a convex domain \(D\) in the Euclidean space, for any pair of points \(x\) and \(y\) in \(D\) let us denote by \(x^\prime\) and \(y^\prime\) the intersections of the line through \(x\) and \(y\) with the boundary of \(D\) closest to \(x\) and \(y\). The logarithm of the crossratio of these four points defines the Hilbert metric on \(D\): \(h(x,y)
Karlsson, Anders, Noskov, Guennadi A.
openaire +2 more sources
Gromov Hyperbolicity in the Cartesian Sum of Graphs
Bulletin of the Iranian Mathematical Society, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carballosa, W. +2 more
openaire +2 more sources
Gromov hyperbolicity of regular graphs.
Ars Comb., 2017Summary: If \(X\) is a geodesic metric space and \(x_1,x_2,x_3\in X\), a geodesic triangle \(T=\{ x_1,x_2,x_3\}\) is the union of the three geodesics \([x_1x_2]\), \([x_2x_3]\) and \([x_3x_1]\) in \(X\). The space \(X\) is \(\delta\)-hyperbolic (in the Gromov sense) if any side of \(T\) is contained in a \(\delta\)-neighborhood of the union of the two ...
Juan Carlos Hernández-Gómez +4 more
openaire +1 more source
Gromov hyperbolicity in the free quasiworld. II
Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. MatemáticaszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qingshan Zhou +2 more
openaire +2 more sources