Conjecture on asymptotically CAT(0) graphs and hyperbolicity
A graph is called -CAT(0) when its geodesic triangles satisfy the corresponding CAT(0) comparison condition up to an additive constant, and it is asymptotically CAT(0) when its asymptotic geometry is CAT(0). A graph is -hyperbolic when its geodesic triangles are uniformly thin. Asymptotically CAT(0) graph conjecture. A graph is asymptotically CAT(0) if and only if it is -hyperbolic. The source motivates this as an analogue of the fact that a graph is -CAT(0) if and only if it is hyperbolic, but gives no resolution of the asymptotic version.
References
Primary source
Aditi Kar, “Asymptotically CAT(0) Groups”, arXiv:0810.4046 (2010).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.