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

DOI10.1515/GCC.2010.013zbMath1222.20018arXiv1003.1096OpenAlexW2963537376MaRDI QIDQ3085994

Bernhard 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

structure treesBass-Serre theoryStallings theoremfinitely generated groups with more than one end

Mathematics Subject Classification ID

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

Related Items (8)

Canonical trees of tree-decompositions ⋮ Vertex Cuts ⋮ A Stallings type theorem for quasi-transitive graphs ⋮ A descriptive construction of trees and Stallings’ theorem ⋮ Nielsen realization by gluing: limit groups and free products ⋮ The classification of connected-homogeneous digraphs with more than one end ⋮ CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES ⋮ From Euclidean geometry to knots and nets

Cites Work

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

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