16 citations · 81 across the 23 of their papers we have counts for
4 papers · 1 filter
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…
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…
Describing Quasi-Graphic Matroids
Nathan Bowler, Daryl Funk, Daniel Slilaty
This is a revised version of our original paper (arXiv:1808.00489v2) incorporating the corrections published in a corrigendum (arXiv:1808.00489v3). Our main theorem as originally s…
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…