Linked tree-decompositions into finite parts
Fuente:
arXiv
Saved in:
| Main Authors: | Albrechtsen, Sandra, Jacobs, Raphael W., Knappe, Paul, Pitz, Max |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Counterexamples regarding linked and lean tree-decompositions of infinite graphs
by: Albrechtsen, Sandra, et al.
Published: (2024)
by: Albrechtsen, Sandra, et al.
Published: (2024)
Displaying prescribed sets of ends by linked tree-decompositions
by: Albrechtsen, Sandra, et al.
Published: (2025)
by: Albrechtsen, Sandra, et al.
Published: (2025)
Refining tree-decompositions so that they display the k-blocks
by: Albrechtsen, Sandra
Published: (2024)
by: Albrechtsen, Sandra
Published: (2024)
Tangle-tree duality in infinite graphs
by: Albrechtsen, Sandra
Published: (2024)
by: Albrechtsen, Sandra
Published: (2024)
Efficiently distinguishing all tangles in locally finite graphs
by: Jacobs, Raphael W., et al.
Published: (2023)
by: Jacobs, Raphael W., et al.
Published: (2023)
Canonical tree-decompositions of chordal graphs
by: Jacobs, Raphael W., et al.
Published: (2025)
by: Jacobs, Raphael W., et al.
Published: (2025)
Canonical graph decompositions via local separations
by: Jacobs, Raphael W., et al.
Published: (2025)
by: Jacobs, Raphael W., et al.
Published: (2025)
Canonical graph decompositions via coverings
by: Diestel, Reinhard, et al.
Published: (2022)
by: Diestel, Reinhard, et al.
Published: (2022)
On vertex sets inducing tangles
by: Albrechtsen, Sandra, et al.
Published: (2024)
by: Albrechtsen, Sandra, et al.
Published: (2024)
The immersion-minimal infinitely edge-connected graph
by: Knappe, Paul, et al.
Published: (2022)
by: Knappe, Paul, et al.
Published: (2022)
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
by: Erde, Joshua, et al.
Published: (2019)
by: Erde, Joshua, et al.
Published: (2019)
On tree-decompositions for infinite chordal graphs
by: Pitz, Max, et al.
Published: (2026)
by: Pitz, Max, et al.
Published: (2026)
Obstructions for normally spanned sets of vertices
by: Lorenz, Nicola, et al.
Published: (2025)
by: Lorenz, Nicola, et al.
Published: (2025)
A grid theorem for strong immersions of walls
by: Diestel, Reinhard, et al.
Published: (2023)
by: Diestel, Reinhard, et al.
Published: (2023)
A structural duality for path-decompositions into parts of small radius
by: Albrechtsen, Sandra, et al.
Published: (2023)
by: Albrechtsen, Sandra, et al.
Published: (2023)
A coarse Halin Grid Theorem with applications to quasi-transitive, locally finite graphs
by: Albrechtsen, Sandra, et al.
Published: (2025)
by: Albrechtsen, Sandra, et al.
Published: (2025)
Circuits through prescribed edges
by: Knappe, Paul, et al.
Published: (2018)
by: Knappe, Paul, et al.
Published: (2018)
The Nash-Williams orientation theorem for graphs with countably many ends
by: Assem, Amena, et al.
Published: (2023)
by: Assem, Amena, et al.
Published: (2023)
On order-compatible paths in infinite graphs
by: Pitz, Max, et al.
Published: (2026)
by: Pitz, Max, et al.
Published: (2026)
Locally chordal graphs
by: Abrishami, Tara, et al.
Published: (2025)
by: Abrishami, Tara, et al.
Published: (2025)
Optimal trees of tangles: refining the essential parts
by: Albrechtsen, Sandra
Published: (2023)
by: Albrechtsen, Sandra
Published: (2023)
Refining trees of tangles in abstract separation systems: inessential parts
by: Albrechtsen, Sandra
Published: (2023)
by: Albrechtsen, Sandra
Published: (2023)
Representations of infinite tree-sets
by: Gollin, J. Pascal, et al.
Published: (2019)
by: Gollin, J. Pascal, et al.
Published: (2019)
Obtaining trees of tangles from tangle-tree duality
by: Elbracht, Christian, et al.
Published: (2020)
by: Elbracht, Christian, et al.
Published: (2020)
A characterisation of graphs quasi-isometric to $K_4$-minor-free graphs
by: Albrechtsen, Sandra, et al.
Published: (2024)
by: Albrechtsen, Sandra, et al.
Published: (2024)
Small counterexamples to the fat minor conjecture
by: Albrechtsen, Sandra, et al.
Published: (2026)
by: Albrechtsen, Sandra, et al.
Published: (2026)
A Menger-type theorem for two induced paths
by: Albrechtsen, Sandra, et al.
Published: (2023)
by: Albrechtsen, Sandra, et al.
Published: (2023)
Bounded diameter tree-decompositions
by: Berger, Eli, et al.
Published: (2023)
by: Berger, Eli, et al.
Published: (2023)
Connectoids II: existence of normal trees
by: Bowler, Nathan, et al.
Published: (2024)
by: Bowler, Nathan, et al.
Published: (2024)
A metrization theorem for edge-end spaces of infinite graphs
by: Pitz, Max
Published: (2025)
by: Pitz, Max
Published: (2025)
The excluded minors for embeddability into a compact surface
by: Georgakopoulos, Agelos
Published: (2023)
by: Georgakopoulos, Agelos
Published: (2023)
Splitter Theorems for Graph Immersions
by: DeVos, Matt, et al.
Published: (2018)
by: DeVos, Matt, et al.
Published: (2018)
On an induced version of Menger's theorem
by: Hendrey, Kevin, et al.
Published: (2023)
by: Hendrey, Kevin, et al.
Published: (2023)
Asymptotic half-grid and full-grid minors
by: Albrechtsen, Sandra, et al.
Published: (2024)
by: Albrechtsen, Sandra, et al.
Published: (2024)
A star-comb lemma for infinite digraphs
by: Reich, Florian
Published: (2024)
by: Reich, Florian
Published: (2024)
Large flames in rooted acyclic digraphs without backward-infinite paths
by: Joó, Attila, et al.
Published: (2025)
by: Joó, Attila, et al.
Published: (2025)
Trees of tangles in infinite separation systems
by: Elbracht, Christian, et al.
Published: (2020)
by: Elbracht, Christian, et al.
Published: (2020)
All graphs are majority 3-choosable
by: Ouborny, Jan, et al.
Published: (2025)
by: Ouborny, Jan, et al.
Published: (2025)
Connectoids I: a universal end space theory
by: Bowler, Nathan, et al.
Published: (2024)
by: Bowler, Nathan, et al.
Published: (2024)
A topological characterization of end space of infinite graphs via games, subspaces and products
by: Aurichi, Leandro, et al.
Published: (2026)
by: Aurichi, Leandro, et al.
Published: (2026)
Similar Items
-
Counterexamples regarding linked and lean tree-decompositions of infinite graphs
by: Albrechtsen, Sandra, et al.
Published: (2024) -
Displaying prescribed sets of ends by linked tree-decompositions
by: Albrechtsen, Sandra, et al.
Published: (2025) -
Refining tree-decompositions so that they display the k-blocks
by: Albrechtsen, Sandra
Published: (2024) -
Tangle-tree duality in infinite graphs
by: Albrechtsen, Sandra
Published: (2024) -
Efficiently distinguishing all tangles in locally finite graphs
by: Jacobs, Raphael W., et al.
Published: (2023)