Joshua Erde

activity

20122025

most citedA counterexample to the reconstruction conjecture for locally finite trees

5 citations · 32 across the 42 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

Bounding the cop number of a graph by its genus

Nathan Bowler, Joshua Erde, Florian Lehner +1

It is known that the cop number $c (G)$ of a connected graph $G$ can be bounded as a function of the genus of the graph $g (G)$ . The best known bound, that $c(G) \leq \left\lfloor \f…

math.CO2019★ 1 cited

Base partition for mixed families of finitary and cofinitary matroids

Joshua Erde, Pascal Gollin, Attila Joó +2

Let $M = (M_{i} : i \in K)$ be a finite or infinite family consisting of matroids on a common ground set $E$ each of which may be finitary or cofinitary. We prove the…

math.CO2019★ 2 cited

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…