16 citations · 81 across the 23 of their papers we have counts for
5 papers · 1 filter
Non-reconstructible locally finite graphs
Nathan Bowler, Joshua Erde, Peter Heinig +2
Two graphs and are \emph{hypomorphic} if there exists a bijection such that for each . A graph is \em…
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 -graphs: bi…
Reconstruction of infinite matroids from their 3-connected minors
Nathan Bowler, Johannes Carmesin, Luke Postle
We show that any infinite matroid can be reconstructed from the torsos of a tree-decomposition over its 2-separations, together with local information at the ends of the tree. We s…
A counterexample to the reconstruction conjecture for locally finite trees
Nathan Bowler, Joshua Erde, Peter Heinig +2
Two graphs and are hypomorphic if there exists a bijection such that for each . A graph is reconstruc…
Matroids over hyperfields
Matthew Baker, Nathan Bowler
We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, and oriented matroids. We call the resulting objects…