2023/11/07 by Murray Elder, G. E. Gardam, Elder, Murray +7
Computer Science · Engineering · Mathematics · #05C12 #05C75 #20F65 #20F67 #68Q42 #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Group Theory (math.GR) #Mathematics and Applications #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2311.03730
openalex publication_date 2023/11/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A connected graph is called 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 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.