Tangle-tree duality in infinite graphs
Sandra Albrechtsen
TL;DR
This paper extends the tangle-tree duality theorem, originally for finite graphs, to the setting of infinite graphs, broadening the theoretical framework for graph decomposition.
Contribution
It introduces a generalized tangle-tree duality theorem applicable to infinite graphs, expanding the scope of prior finite graph results.
Findings
Established a duality theorem for infinite graphs
Extended the applicability of tangle-tree decompositions
Provided new tools for analyzing infinite graph structures
Abstract
We extend Robertson and Seymour's tangle-tree duality theorem to infinite graphs.
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.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Limits and Structures in Graph Theory