Trees of tangles in abstract separation systems

Autor:	Jakob Kneip, Christian Elbracht, Maximilian Teegen
Rok vydání:	2021
Předmět:	Computer Science::Computer Science and Game Theory 010102 general mathematics Separation (statistics) TheoryofComputation_GENERAL 0102 computer and information sciences Mathematical proof Mathematics::Geometric Topology 01 natural sciences Matroid Theoretical Computer Science Submodular set function Combinatorics Computational Theory and Mathematics Computer Science::Discrete Mathematics 010201 computation theory & mathematics FOS: Mathematics Mathematics - Combinatorics Discrete Mathematics and Combinatorics Order (group theory) 05C05 05C40 05C83 06A07 Combinatorics (math.CO) 0101 mathematics Computer Science::Data Structures and Algorithms Mathematics
Zdroj:	Journal of Combinatorial Theory, Series A. 180:105425
ISSN:	0097-3165
DOI:	10.1016/j.jcta.2021.105425
Popis:	We prove canonical and non-canonical tree-of-tangles theorems for abstract separation systems that are merely structurally submodular. Our results imply all known tree-of-tangles theorems for graphs, matroids and abstract separation systems with submodular order functions, with greatly simplified and shortened proofs.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::372ccbbcff092248999be4067bc6d86e https://doi.org/10.1016/j.jcta.2021.105425 Zobrazit plný text záznamu Full Text from ScienceDirect