The Menger-like property of the three-width of infinite graphs
The tree-width of a (possibly infinite) graph G is the minimum n such that G may be decomposed into a ``tree-structure of pieces each with at most \(n+1\) vertices. We prove that if G has tree-width n, then G can be decomposed in such a way that for every \(k\geq 0\) and any two pieces P and Q of this ``tree-structure either there are k disjoint paths between P and Q, or there is third piece R between P and Q with at most k-1 vertices. Our proof makes use of a finite version of this result proved by the second author and a compactness argument.
- Menger's theorem for infinite graphs
- A Menger-like property of tree-width: The finite case
- On the girth of infinite graphs
- Menger's theorem for infinite graphs with ends
- On the metric dimension of infinite graphs
- On the metric dimension of infinite graphs
- A Mengerian theorem for infinite graphs with ideal points
- On the cycle space of an infinite 3-connected graph
- scientific article; zbMATH DE number 15354
- On the Hadwiger number of infinite graphs
- A Menger-like property of tree-width: The finite case
- Clique-sums, tree-decompositions and compactness
- Graph minors. III. Planar tree-width
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4164908 (Why is no real title available?)
- scientific article; zbMATH DE number 3479763 (Why is no real title available?)
- Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
- Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
- A Menger-like property of tree-width: The finite case
- Excluding infinite minors
- On tree-partitions of graphs
- A Menger-like property of tree-cut width
- Characterising \(k\)-connected sets in infinite graphs
- scientific article; zbMATH DE number 1146232 (Why is no real title available?)
- Ubiquity of locally finite graphs with extensive tree-decompositions
- Counterexamples regarding linked and lean tree-decompositions of infinite graphs
- Linked tree-decompositions of represented infinite matroids
- The vertex sets of subtrees of a tree
This page was built for publication: The Menger-like property of the three-width of infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121910)
