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

DOI10.1515/GCC.2010.013zbMATH Open1222.20018arXiv1003.1096OpenAlexW2963537376MaRDI QIDQ3085994FDOQ3085994

Authors: B. Krön 

Publication date: 1 April 2011

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

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.

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

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

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)

Cites Work

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

Cited In (12)

• CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES
• Nielsen realization by gluing: limit groups and free products
• Title not available (Why is that?)
• Grushko's theorem
• Canonical trees of tree-decompositions
• From Euclidean geometry to knots and nets
• The classification of connected-homogeneous digraphs with more than one end
• A geometric proof of Stallings' theorem on groups with more than one end.
• Vertex Cuts
• A Stallings type theorem for quasi-transitive graphs
• A descriptive construction of trees and Stallings’ theorem
• Some finiteness results concerning separation in graphs

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)