Graphs and groups with unique geodesics
Abstract
A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually free. Before now, it was open whether finitely generated and geodetic implied hyperbolic. In fact we prove something more general: if a quasi-transitive locally finite connected undirected graph is geodetic then it is quasi-isometric to a tree. Our main tool is to define a \emph{boundary} of a graph and understand how the local behaviour influences it when the graph is geodetic. Our results unify, and represent significant progress on, research initiated by Ore, Shapiro, and Madlener and Otto.
Cite
@article{arxiv.2311.03730,
title = {Graphs and groups with unique geodesics},
author = {Murray Elder and Giles Gardam and Adam Piggott and Davide Spriano and Kane Townsend},
journal= {arXiv preprint arXiv:2311.03730},
year = {2024}
}
Comments
Error in the proof of Theorem 4.8, the case $\xi_o(1)=p$ is not covered by the argument given, which has an impact on the remaining results