Hamburg papers on
Tangle-tree duality
- Tangle-tree duality in infinite graphs (S. Albrechtsen), preprint 2024;
ArXiv
- Refining trees of tangles in abstract separation systems I: Inessential parts (S. Albrechtsen), preprint 2023; ArXiv
- Obtaining trees of tangles from tangle-tree duality (C. Elbracht, J. Kneip and M. Teegen), Journal of Combinatorics 13.2 (2022), 251-287.; ArXiv
- A short derivation of the structure theorem for graphs with excluded topological minors (J. Erde and D. Weißauer), SIAM J. Discrete Math 33 (2019), 1654-1661; ArXiv
- Structural submodularity and tangles in abstract separation systems (R. Diestel, J. Erde and D. Weißauer), JCTA 167C (2019), 155-180; PDF
- Algebraically grid-like graphs have large tree-width (D. Weißauer), Electronic J.Comb 21 (2019); ArXiv
- A unified treatment of linked and lean tree-decompositions (J. Erde), Journal of Combinatorial Theory, Series B, Volume 130 (2018), 114-143 ArXiv
- On the block number of graphs (D. Weißauer), SIAM J. Discret.Math. 33(1)(2019), 346-357; ArXiv
- Tangle-tree duality in abstract separation systems (R. Diestel and S. Oum), Advances in Mathematics 377 (2021), 107470; PDF
- Tangle-tree duality: in graphs, matroids and beyond (R. Diestel and S. Oum), Combinatorica 39 (2019), 879-910; PDF.
- Tangles and the Mona Lisa (R. Diestel & G. Whittle), preprint 2016; PDF
- Duality theorems for blocks and tangles in graphs (R. Diestel, J. Erde and Ph. Eberenz), SIAM Journal on Discrete Mathematics 31 (2017), 1514-1528; PDF
- Refining a tree-decomposition which distinguishes tangles (J. Erde), SIAM Journal on Discrete Mathematics 31 (2017), 1529-1551; ArXiV
- k-Blocks: a connectivity invariant for graphs (J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark), SIDMA 28 (2014), 1876-1891; PDF
- On the excluded minor structure theorem for graphs of large tree-width (Reinhard Diestel, Ken-ichi Kawarabayashi, Theo Müller and Paul Wollan), J. Combin. Theory (Series B) 102 (2012), 1189-1210; PDF
Theses:
- Tangles and where to find them (J. Kneip), PhD dissertation, Hamburg 2020; PDF
- How to build a tree of tangles by local refinements (R. Jacobs), MSc dissertation, Hamburg 2020; PDF
- On Tangles and Trees (D. Weißauer), PhD dissertation, Hamburg 2018; PDF
- Tangles determined by majority vote (C. Elbracht), MSc dissertation, Hamburg 2017; PDF
- Characteristics of profiles (Ph. Eberenz), MSc dissertation, Hamburg 2015; PDF
- Tree-decomposition in finite and infinite graphs (J. Carmesin), PhD dissertation, Hamburg 2015; PDF
- Polishing tree-decompositions to bring out the k-blocks (P. Gollin), MSc dissertation, Hamburg 2014; PDF