13 citations · 34 across the 16 of their papers we have counts for
5 papers · 1 filter
Duality and tangles of set separations
Reinhard Diestel, Christian Elbracht, Joshua Erde +1
Applications of tangles of connectivity systems suggest a duality between these, in which for two sets and the elements of map to subsets of , and the…
Agile Sets in Graphs
Christian Elbracht, Jay Lilian Kneip, Maximilian Teegen
A set of vertices in a graph is agile if, however we partition the set into two parts, we can always find two vertex-disjoint connected subgraphs where one covers the first and the…
Point sets and functions inducing tangles of set separations
Reinhard Diestel, Christian Elbracht, Raphael W. Jacobs
Tangles, as introduced by Robertson and Seymour, were designed as an indirect way of capturing clusters in graphs and matroids. They have since been shown to capture clusters in mu…
The Unravelling Problem
Christian Elbracht, Jay Lilian Kneip, Maximilian Teegen
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.
The Structure of Submodular Separation Systems
Christian Elbracht, Jay Lilian Kneip, Maximilian Teegen
We analyse various structural and order-theoretical aspects of abstract separation systems and partial lattices, as well as the relationship between the different submodularity con…