Trees of tangles in infinite separation systems
Christian Elbracht, Jay Lilian Kneip, Maximilian Teegen
TL;DR
This paper extends the concept of trees of tangles to infinite separation systems, providing new theoretical tools for analyzing infinite graphs and abstract separation systems.
Contribution
It introduces infinite analogues of the splinter lemma, enabling the derivation of tree-of-tangles theorems for infinite structures.
Findings
Infinite analogues of the splinter lemma established
Tree-of-tangles theorems derived for infinite graphs
Applicable to infinite abstract separation systems
Abstract
We present infinite analogues of our splinter lemma from [Trees of tangles in abstract separation systems, arXiv:1909.09030]. From these we derive several tree-of-tangles-type theorems for infinite graphs and infinite abstract separation systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.