Max Pitz

activity

20132025

most citedApproximating infinite graphs by normal trees

10 citations · 20 across the 26 of their papers we have counts for

collaborators

Showing 2016Show all

4 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

Graph-Like Compacta: Characterizations and Eulerian Loops

Benjamin Espinoza, Paul Gartside, Max Pitz

A compact graph-like space is a triple $(X, V, E)$ where $X$ is a compact, metrizable space, $V \subseteq X$ is a closed zero-dimensional subset, and $E$ is an index set such that $X…

math.CO2016

Minimal obstructions for normal spanning trees

Nathan Bowler, Stefan Geschke, Max Pitz

Diestel and Leader have characterised connected graphs that admit a normal spanning tree via two classes of forbidden minors. One class are Halin's $(ℵ_{0}, ℵ_{1})$ -graphs: bi…

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…