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 $({\aleph }_0,{\aleph }_1)$-graphs: bi…