In 1964 R. Halin raised the question if every infinite connected graph G has a spanning tree T with the same structure as G in the sense that every end of G is represented by precisely one end of T. We answer the question in the negative even for graphs of infinite connectivity (and hence with only one end). A negative answer was obtained independently by P. D. Seymour and R. Thomas and by P. Komjath.
