13 citations · 28 across the 11 of their papers we have counts for
4 papers · 1 filter
Profinite tree sets
Jay Lilian Kneip
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separa…
Ends as tangles
Jay Lilian Kneip
Every end of an infinite graph defines a tangle of infinite order in . These tangles indicate a highly cohesive substructure in the graph if and only if they are closed…
Trees of tangles in abstract separation systems
Christian Elbracht, Jay Lilian Kneip, Maximilian Teegen
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 t…
Representations of infinite tree-sets
J. Pascal Gollin, Jay Lilian Kneip
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We…