Cutting up graphs revisited -- a short proof of Stallings' structure theorem.

DOI10.1515/GCC.2010.013MaRDI QIDQ3085994zbMATH OpenOpenAlexFDO

Authors B. Krön

Publication date 1 April 2011

Published in Groups - Complexity - Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

Bass-Serre theoryStallings theoremstructure treesfinitely generated groups with more than one end

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Groups acting on trees (20E08) Generators, relations, and presentations of groups (20F05)

Abstract: This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This was first done in "Cutting up graphs" by M.J. Dunwoody. The main ideas are based on the paper "Vertex cuts" by M.J. Dunwoody and the author. We extend the theorem to a detailed combinatorial proof of J.R. Stallings' theorem on the structure of finitely generated groups with more than one end.

Recommendations

• A geometric proof of Stallings' theorem on groups with more than one end.
• Some finiteness results concerning separation in graphs
• Vertex cuts
• A Stallings type theorem for quasi-transitive graphs
• A descriptive construction of trees and Stallings' theorem

Cites work

• Accessibility and Groups of Cohomological Dimension One
• Andrews-Gordon style identities
• Cutting up graphs
• Ends of graphs
• Ends of graphs. II
• Finite separating sets in locally finite graphs
• On the connectivities of finite and infinite graphs
• On torsion-free groups with infinitely many ends
• Quasi-isometries between non-locally-finite graphs and structure trees
• Vertex-transitive graphs and accessibility
• Über die Enden diskreter Räume und Gruppen
• Über die Enden topologischer Räume und Gruppen

Cited in

(15)

• Nielsen realization by gluing: limit groups and free products
• Structure trees, networks and almost invariant sets
• scientific article; zbMATH DE number 844155 (Why is no real title available?)
• Grushko's theorem
• Canonical trees of tree-decompositions
• From Euclidean geometry to knots and nets
• Vertex cuts
• A descriptive construction of trees and Stallings' theorem
• Context-free groups and their structure trees.
• On the one-endedness of graphs of groups.
• The classification of connected-homogeneous digraphs with more than one end
• A geometric proof of Stallings' theorem on groups with more than one end.
• A Stallings type theorem for quasi-transitive graphs
• Some finiteness results concerning separation in graphs
• A cactus theorem for end cuts

This page was built for publication: Cutting up graphs revisited -- a short proof of Stallings' structure theorem.

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