English

Obtaining trees of tangles from tangle-tree duality

Combinatorics 2025-05-20 v1

Abstract

We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding the node degrees in them. We also present a slight strengthening and simplified proof of the duality theorem, which allows us to derive a tree-of-tangles theorem also for tangles of different orders.

Keywords

Cite

@article{arxiv.2011.09758,
  title  = {Obtaining trees of tangles from tangle-tree duality},
  author = {Christian Elbracht and Jay Lilian Kneip and Maximilian Teegen},
  journal= {arXiv preprint arXiv:2011.09758},
  year   = {2025}
}

Comments

29 pages

R2 v1 2026-06-23T20:22:01.767Z