2013/11/15 by M. J. Dunwoody, Dunwoody, M. J.
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Geometric Topology (math.GT) #Group Theory (math.GR) #Limits and Structures in Graph Theory #math.CO #math.GR #math.GT
paper · pdf · doi:10.48550/arxiv.1311.3929
15 pages, 5 diagrams
openalex publication_date 2013/11/15 · arxiv created 2015/01/02 · arxiv updated 2015/01/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper it is shown that for any network there is a uniquely determined network based on a structure tree that provides a convenient way of determining a minimal cut separating a pair s, t where each of s, t is either a vertex or an end in the original network. A Max-Flow Min-Cut Theorem is proved for any network. In the case of a Cayley Graph for a finitely generated group the theory provides another proof of Stallings' Theorem on the structure of groups with more than one end.