2020/11/19 by Elbracht, Christian, Kneip, Jay Lilian, Teegen, Maximilian
#05C05 #05C40 #05C83 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2011.09758
We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding the node degrees in them. We also present a slight strengthening and simplified proof of the duality theorem, which allows us to derive a tree-of-tangles theorem also for tangles of different orders.