Obstructions for normally spanned sets of vertices

Nicola Lorenz, Max Pitz

Halin conjectured that a graph has a normal spanning tree if and only if every minor of it has countable colouring number. This has recently been proven by the second author. In th…