Canonical trees of tree-decompositions (Q2664548): Difference between revisions

Trees of tree-decompositions can be deemed as a class of tree decompositions. Here every part of each of these tree-decompositions is modified by another tree-decomposition. It can be naturally grouped for finite graphs, as single tree-decomposition. The authors opine that \textit{N. Robertson} and \textit{P. D. Seymour}'s tangle tree theorem [J. Comb. Theory, Ser. B 52, No. 2, 153--190 (1991; Zbl 0764.05069)] can be generalized to infinite graphs, in that one can get a canonical tree of tree-decompositions distinguishing the principal tangles. This result is best possible in the sense of their example that `trees of tree-decompositions' cannot be strengthened to `tree decompositions'. Moreover, the authors prove that for locally finite graphs it provides for every $k\in N$ natural tree-decompositions that separates out each $k$-distinguishable end tactfully. The ideas involved here in proofs are mind blowing and original.