Accessibility in transitive graphs

DOI10.1007/S00493-017-3361-1MaRDI QIDQ1786050zbMATH OpenOpenAlexFDO

Authors Matthias Hamann

Publication date 24 September 2018

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.7677

zbMATH Keywords

accessibilityCayley graphhyperbolic graphpresented grouptransitive graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Infinite graphs (05C63)

Abstract: We prove that the cut space of any transitive graph $G$ is a finitely generated $mAut(G)$-module if the same is true for its cycle space. This confirms a conjecture of Diestel which says that every locally finite transitive graph whose cycle space is generated by cycles of bounded length is accessible. In addition, it implies Dunwoody's conjecture that locally finite hyperbolic transitive graphs are accessible. As a further application, we obtain a combinatorial proof of Dunwoody's accessibility theorem of finitely presented groups.

Review text

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.

Recommendations

• Vertex-transitive graphs and accessibility
• On accessibility of groups
• Accessibility and ends of graphs
• Planar transitive graphs
• On accessibility for pro-p groups

Cites work

• Accessibility and Groups of Cohomological Dimension One
• Coarse differentiation of quasi-isometries. I: Spaces not quasi-isometric to Cayley graphs
• Commability and focal locally compact groups
• Context-free groups and their structure trees.
• Cut sets and normed cohomology with applications to percolation
• Cutsets in Infinite Graphs
• scientific article; zbMATH DE number 475446 (Why is no real title available?)
• Infinite-ended groups with planar Cayley graphs
• Metric geometry of locally compact groups
• Pairs of relative cohomological dimension one
• Planar transitive graphs
• Quasi-actions on trees. I: Bounded valence
• Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
• The accessibility of finitely presented groups
• Vertex-transitive graphs and accessibility

Cited in

(15)

• Reachability relations and the structure of transitive digraphs
• Vertex-transitive graphs and accessibility
• On accessibility for pro-p groups
• Accessibility and reliability for connected bipartite graphs
• Planar transitive graphs
• Generating the cycle space of planar graphs
• A Stallings type theorem for quasi-transitive graphs
• scientific article; zbMATH DE number 475446 (Why is no real title available?)
• scientific article; zbMATH DE number 2171034 (Why is no real title available?)
• A note on accessible groups.
• The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem
• Periodic colorings and orientations in infinite graphs
• Asymptotic half-grid and full-grid minors
• Tree amalgamations and quasi-isometries
• The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem (extended abstract)

This page was built for publication: Accessibility in transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786050)