A simple existence criterion for normal spanning trees in infinite graphs

Publication date 20 February 2012

Abstract: Halin proved in 1978 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_{a l e p h_{0}}

, one in which every edge has been replaced by uncountably many parallel edges; and (ii)

G

has no

K_{a l e p h_{0}}

subgraph. We show that the second condition is unnecessary.

This page was built for publication: A simple existence criterion for normal spanning trees in infinite graphs