Quickly Proving Diestel's Normal Spanning Tree Criterion

Abstract

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.