6 citations · 16 across the 24 of their papers we have counts for
4 papers · 1 filter
Base partition for mixed families of finitary and cofinitary matroids
Joshua Erde, Pascal Gollin, Attila Joó +2
Let be a finite or infinite family consisting of matroids on a common ground set each of which may be finitary or cofinitary. We prove the…
On the Infinite Lucchesi-Younger Conjecture I
J. Pascal Gollin, Karl Heuer
A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digra…
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…
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
Joshua Erde, Pascal Gollin, Atilla Joó +2
We show that if a graph admits a packing and a covering both consisting of many spanning trees, where is some infinite cardinal, then the graph also admits a decomposition…