Quickly proving Diestel's normal spanning tree criterion

2020/06/04 by Pitz, Max
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2006.02994

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.

Related

• A unified existence theorem for normal spanning trees
• A simple existence criterion for normal spanning trees in infinite graphs
• A new obstruction for normal spanning trees
• Proof of Halin's normal spanning tree conjecture
• Obstructions for normally spanned sets of vertices