On -geodetic graphs and groups
arXiv:2211.13397
Abstract
We call a graph -geodetic, for some , if it is connected and between any two vertices there are at most geodesics. It is shown that any hyperbolic group with a -geodetic Cayley graph is virtually-free. Furthermore, in such a group the centraliser of any infinite order element is an infinite cyclic group. These results were known previously only in the case that . A key tool used to develop the theorem is a new graph theoretic result concerning ``ladder-like structures'' in a -geodetic graph.
12 pages, 12 figures