15 citations · 34 across the 12 of their papers we have counts for
4 papers · 1 filter
Characterising -connected sets in infinite graphs
J. Pascal Gollin, Karl Heuer
A -connected set in an infinite graph, where is an integer, is a set of vertices such that any two of its subsets of the same size can be connected by $\el…
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…
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…
An analogue of Edmonds' Branching Theorem for infinite digraphs
J. Pascal Gollin, Karl Heuer
We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whos…