13 citations · 28 across the 11 of their papers we have counts for
3 papers · 2 filters
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…
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…