  Halin conjectured 20 years ago that a graph has a normal spanning tree if and
only if every minor of it has countable colouring number. We prove Halin's
conjecture. This implies a forbidden minor characterisation for the property of
having a normal spanning tree.
