The Unravelling Problem

2021/03/23 by Christian Elbracht, Elbracht, Christian, Jakob Kneip +3
Computer Science · #05B99 #05C40 #06A07 #Advanced Algebra and Logic #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2103.12565

openalex publication_date 2021/03/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We identify and study a simple combinatorial problem that is derived from submodularity issues encountered in the theory of tangles of graphs and abstract separation systems.

Related

• Refining trees of tangles in abstract separation systems: inessential parts
• Structural submodularity and tangles in abstract separation systems
• A canonical tree-of-tangles theorem for structurally submodular separation systems
• Computing with Tangles
• A Note on Generic Tangle Algorithms