Entanglements
Journal of Combinatorial Theory Series B(2024)
摘要
Robertson and Seymour constructed for every graph G a tree-decomposition that efficiently distinguishes all the tangles in G . While all previous constructions of these decompositions are either iterative in nature or not canonical, we give an explicit one-step construction that is canonical. The key ingredient is an axiomatisation of ‘local properties’ of tangles. Generalisations to locally finite graphs and matroids are also discussed.
更多查看译文
关键词
Entanglement,Tree of tangles,Nested set of separations,Efficiently distinguish,Canonical
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要