Entanglements
Entanglements
复制标题
纠缠
DOI:
10.1016/j.jctb.2023.08.007
复制
发表时间:
2024
期刊:
影响因子:
--
通讯作者:
Carmesin J
中科院分区:
文献类型:
--
作者:
Carmesin J
Robertson and Seymour constructed for every graphGa tree-decomposition that efficiently distinguishes all the tangles inG. 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.