Canonical graph decompositions via coverings
From MaRDI portal
Publication:6507899
arXiv2207.04855MaRDI QIDQ6507899FDOQ6507899
Authors: Reinhard Diestel, Raphael W. Jacobs, Paul Knappe, Jan Kurkofka 
Abstract: We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as determined by the relative position of these parts, is described by a coarser . This is a simpler graph determined entirely by the decomposition, not imposed. The model and decomposition are obtained as projections of the tangle-tree structure of a covering of the given graph that reflects its local structure while unfolding its global structure. In this way, the tangle theory from graph minors is brought to bear canonically on arbitrary graphs, which need not be tree-like. Our theorem extends to locally finite quasi-transitive graphs, and in particular to locally finite Cayley graphs. It thereby offers a canonical decomposition for finitely generated groups into local parts, whose relative structure is displayed by a graph.
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Connectivity (05C40) Infinite graphs (05C63) Graph minors (05C83) Relations of low-dimensional topology with graph theory (57M15)
This page was built for publication: Canonical graph decompositions via coverings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6507899)
