An end-faithful spanning tree counterexample
Paul D. Seymour, Robin B. Thomas · Proceedings of the American Mathematical Society · 1991
We find an infinitely-connected graph in which every spanning tree has a 2 2 -way infinite path. This disproves Halin’s well-known "end-faithful spanning tree" conjecture and also disproves a recent conjecture of Širáň.