Edge-connectivity and tree-structure in finite and infinite graphs

Abstract

We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in \mathbb{N}\cup \{\infty \}$ simultaneously.

arXiv comment12 pages, 2 figures

References in corpus (10)

• Connectivity and tree structure in finite graphs
• Tangle-tree duality in abstract separation systems
• Profiles of separations: in graphs, matroids and beyond
• Trees of tangles in abstract separation systems
• Tangles and the Mona Lisa
• Trees of tangles in infinite separation systems
• $k$-Blocks: a connectivity invariant for graphs
• Canonical tree-decompositions of finite graphs II. Essential parts
• Canonical tree-decompositions of finite graphs I. Existence and algorithms
• Every infinitely edge-connected graph contains the Farey graph or $T_{{\aleph }_0}\ast t$ as a minor