Limit-closed Profiles
Combinatorics
2023-09-14 v1
Abstract
Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so far tangle-tree theorems have only been shown for special cases of separation systems, in particular when the separation system arises from a (locally finite) infinite graph. We present a tangle-tree theorem for infinite separation systems where we do not place restrictions on the separation system itself but on the tangles to be arranged in a tree.
Keywords
Cite
@article{arxiv.2309.06954,
title = {Limit-closed Profiles},
author = {Ann-Kathrin Elm and Hendrik Heine},
journal= {arXiv preprint arXiv:2309.06954},
year = {2023}
}
Comments
12 pages, 2 figures