Author:
ELBRACHT CHRISTIAN,KNEIP JAKOB,TEEGEN MAXIMILIAN
Abstract
Abstract
We present infinite analogues of our splinter lemma for constructing nested sets of separations. From these we derive several tree-of-tangles-type theorems for infinite graphs and infinite abstract separation systems.
Publisher
Cambridge University Press (CUP)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficiently distinguishing all tangles in locally finite graphs;Journal of Combinatorial Theory, Series B;2024-07
2. Entanglements;Journal of Combinatorial Theory, Series B;2024-01
3. Canonical decompositions of 3-connected graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. A tree-of-tangles theorem for infinite tangles;Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg;2022-10