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 2016Show all

3 papers · 1 filter

math.CO2016

Non-reconstructible locally finite graphs

Nathan Bowler, Joshua Erde, Peter Heinig +2

Two graphs $G$ and $H$ are \emph{hypomorphic} if there exists a bijection $φ : V (G) \to V (H)$ such that $G - v ≅ H - φ (v)$ for each $v \in V (G)$ . A graph $G$ is \em…

math.CO2016★ 5 cited

A counterexample to the reconstruction conjecture for locally finite trees

Nathan Bowler, Joshua Erde, Peter Heinig +2

Two graphs $G$ and $H$ are hypomorphic if there exists a bijection $φ : V (G) \to V (H)$ such that $G - v ≅ H - φ (v)$ for each $v \in V (G)$ . A graph $G$ is reconstruc…

math.CO2016

Duality theorems for blocks and tangles in graphs

Reinhard Diestel, Philipp Eberenz, Joshua Erde

We prove a duality theorem applicable to a a wide range of specialisations, as well as to some generalisations, of tangles in graphs. It generalises the classical tangle duality th…