13 citations · 28 across the 11 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018
Tangles are Decided by Weighted Vertex Sets
Christian Elbracht, Jay Lilian Kneip, Maximilian Teegen
We show that, given a -tangle in a graph , there always exists a weight function such that a separation of of order $ {…
math.CO2018
Separations of sets
Nathan Bowler, Jay Lilian Kneip
Abstract separation systems are a new unifying framework in which separations of graph, matroids and other combinatorial structures can be expressed and studied. We characterize th…
math.CO2018
Profinite separation systems
Reinhard Diestel, Jay Lilian Kneip
Separation systems are posets with additional structure that form an abstract setting in which tangle-like clusters in graphs, matroids and other combinatorial structures can be ex…