Vertex Cuts

Given a connected graph, in many cases it is possible to construct a structure tree that provides information about the ends of the graph or its connectivity. For example Stallings' theorem on the structure of groups with more than one end can be proved by analyzing the action of the group on a structure tree and Tutte used a structure tree to investigate finite 2-connected graphs, that are not 3-connected. Most of these structure tree theories have been based on edge cuts, which are components of the graph obtained by removing finitely many edges. A new axiomatic theory is described here using vertex cuts, components of the graph obtained by removing finitely many vertices. This generalizes Tutte's decomposition of 2-connected graphs to k-connected graphs for any k, in finite and infinite graphs. The theory can be applied to nonlocally finite graphs with more than one vertex end, i.e. ends that can be separated by removing a finite number of vertices. This gives a decomposition for a group acting on such a graph, generalizing Stallings' theorem. Further applications include the classification of distance transitive graphs and k-CS-transitive graphs.

[1]  M. J. Dunwoody Cutting up graphs , 1982, Comb..

[2]  M. Hamann End-transitive graphs , 2010, 1003.3665.

[3]  Wolfgang Woess,et al.  Topological groups and infinite graphs , 1991, Discret. Math..

[4]  John Stallings,et al.  On Torsion-Free Groups with Infinitely Many Ends , 1968 .

[5]  Rudolf Halin,et al.  Lattices of cuts in graphs , 1991 .

[6]  Matthias Hamann,et al.  A classification of connected-homogeneous digraphs , 2010 .

[7]  M. J. Dunwoody PLANAR GRAPHS AND COVERS , 2007, 0708.0920.

[8]  Panos Papasoglu,et al.  A Cactus Theorem for End Cuts , 2014, Int. J. Algebra Comput..

[9]  B. Kron Cutting up graphs revisited - a short proof of Stallings' structure theorem , 2010, 1003.1096.

[10]  H. A. Jung,et al.  On the connectivities of finite and infinite graphs , 1977 .

[11]  Nellie Clarke Brown Trees , 1896, Savage Dreams.

[12]  Carsten Thomassen,et al.  Vertex-Transitive Graphs and Accessibility , 1993, J. Comb. Theory, Ser. B.

[13]  W. T. Tutte Graph Theory , 1984 .

[14]  H. Freudenthal,et al.  Neuaufbau Der Endentheorie , 1942 .

[15]  Bernhard Krön,et al.  Cutting up graphs revisited – a short proof of Stallings' structure theorem , 2010, Groups Complex. Cryptol..

[16]  Matthias Hamann,et al.  The classification of connected-homogeneous digraphs with more than one end , 2012 .

[17]  Rudolf Halin,et al.  Some finiteness results concerning separation in graphs , 1992, Discret. Math..

[18]  Brigitte Servatius,et al.  The Structure of Locally Finite Two-Connected Graphs , 1995, Electron. J. Comb..

[19]  M. J. Dunwoody,et al.  The algebraic torus theorem , 2000 .

[20]  Heinz Adolf Jung,et al.  Finite Separating Sets in Locally Finite Graphs , 1993, J. Comb. Theory, Ser. B.

[21]  Julian Pott,et al.  Transitivity conditions in infinite graphs , 2009, Comb..

[23]  John Stallings,et al.  Group Theory and Three-dimensional Manifolds , 1971 .

[24]  Maya Jakobine Stein,et al.  Connectivity and tree structure in finite graphs , 2011, Comb..

[25]  M. J. Dunwoody Structure Trees and Networks , 2013, 1311.3929.

[26]  Daniel E Cohen,et al.  Groups of Cohomological Dimension One , 1972 .

[27]  Maya Stein,et al.  Ends of graphs , 2005 .

[28]  Volker Diekert,et al.  Context-Free Groups and their Structure Trees , 2012, Int. J. Algebra Comput..

[29]  Warren Dicks,et al.  Groups Acting on Graphs , 1989 .

[30]  Rögnvaldur G. Möllert Ends of graphs. II , 1992, Mathematical Proceedings of the Cambridge Philosophical Society.

[31]  B Kr¨on,et al.  End Compactifications in Non-locally-finite Graphs , 2022 .

[32]  Rögnvaldur G. Möller,et al.  Metric ends, fibers and automorphisms of graphs , 2008 .

[33]  H. Freudenthal,et al.  Über die Enden topologischer Räume und Gruppen , 1931 .

[35]  R. Bruce Richter Decomposing Infinite 2-Connected Graphs into 3-Connected Components , 2004, Electron. J. Comb..

[36]  P. Kropholler An analogue of the torus decomposition theorem for certain Poincaré duality groups , 1990 .

[37]  H. Freudenthal,et al.  Über die Enden diskreter Räume und Gruppen , 1944 .