A simple existence criterion for normal spanning trees (Q286119)

Summary: \textit{R. Halin} proved in 1978 [Ann. Discrete Math. 3, 93--109 (1978; Zbl 0383.05034)] that there exists a normal spanning tree in every connected graph \(G\) that satisfies the following two conditions: (i) \(G\) contains no subdivision of a `fat' \(K_{\aleph_{0}}\), one in which every edge has been replaced by uncountably many parallel edges; and (ii) \(G\) has no \(K_{\aleph_{0}}\) subgraph. We show that the second condition is unnecessary.