Accessibility in transitive graphs (Q1786050)

A locally finite transitive graph is accessible if there exists some \(k\) such that any two ends can be separated by at most \(k\) edges. It can be shown that a finitely generated group is accessible if and only if some of its locally finite Cayley graphs is accessible. It was conjectured that locally finite hyperbolic transitive graphs are accessible. More generally, locally finite transitive graphs are accessible as soon as their cycle spaces are generated by cycles of bounded length. It can be shown that the finitely presented groups are accessible. The present paper confirms both conjectures and gives a result for the larger class of all locally finite transitive graphs that is similar to the accessibility theorem for finitely generated groups. In addition, the paper obtains a combinatorial proof of Dunwoody's accessibility theorem of finitely presented groups.