5 citations · 32 across the 42 of their papers we have counts for
4 papers · 1 filter
Ubiquity in graphs II: Ubiquity of graphs with nowhere-linear end structure
Nathan Bowler, Christian Elbracht, Joshua Erde +4
A graph is said to be -ubiquitous, where is the minor relation between graphs, if whenever is a graph with for all , the…
A short derivation of the structure theorem for graphs with excluded topological minors
Joshua Erde, Daniel Weißauer
As a major step in their proof of Wagner's conjecture, Robertson and Seymour showed that every graph not containing a fixed graph as a minor has a tree-decomposition in which e…
Ubiquity in graphs I: Topological ubiquity of trees
Nathan Bowler, Christian Elbracht, Joshua Erde +4
Let be a relation between graphs. We say a graph is \emph{-ubiquitous} if whenever is a graph with for all $n \in \mathb…
Structural submodularity and tangles in abstract separation systems
Reinhard Diestel, Joshua Erde, Daniel Weißauer
We prove a tangle-tree theorem and a tangle duality theorem for abstract separation systems that are submodular in the structural sense that, for every pair of oriented se…