3 papers
math.CO2023
A structural duality for path-decompositions into parts of small radius
Sandra Albrechtsen, Reinhard Diestel, Ann-Kathrin Elm +4
It is an easy observation that if a graph~ admits a path-decomposition whose parts have small radius, then contains no large subdivision of or as a (quasi-)g…
math.CO2023
Pseudoflowers in infinite connectivity systems
Ann-Kathrin Elm
Given a graph or a matroid, a tree of tangles is a tree decomposition that displays the structure of the connectivity: every edge of the decomposition tree induces a separation, th…
math.CO2020
A tree-of-tangles theorem for infinite tangles
Ann-Kathrin Elm, Jan Kurkofka
Carmesin has extended Robertson and Seymour's tree-of-tangles theorem to the infinite tangles of locally finite infinite graphs. We extend it further to the infinite tangles of all…