The Unravelling Problem
Christian Elbracht, Jay Lilian Kneip, Maximilian Teegen
TL;DR
This paper introduces and analyzes a simple combinatorial problem related to submodularity challenges in graph tangles and separation systems, aiming to deepen understanding of these complex structures.
Contribution
It presents a new combinatorial problem derived from submodularity issues in graph theory and separation systems, providing insights into their structural properties.
Findings
Identifies a fundamental combinatorial problem linked to submodularity.
Provides theoretical analysis of the problem's properties.
Connects the problem to graph tangles and separation systems.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · semigroups and automata theory · Advanced Graph Theory Research