Quickly proving diestel’s normal spanning tree criterion

We present two short proofs for Diestel’s criterion that a connected graph has a normal spanning tree provided it contains no subdivision of a countable clique in which every edge has been replaced by uncountably many parallel edges.