An end-faithful spanning tree counterexample

We find an infinitely-connected graph in which every spanning tree has a 2-way infinite path. This disproves Halin's well-known end-faithful spanning tree conjecture and also disproves a recent conjecture of Siran

[1]  R. Halin,et al.  Simplicial Decompositions of Infinite Graphs , 1978 .

[2]  Neil Robertson,et al.  Excluding subdivisions of infinite cliques , 1992 .

[3]  J. Malitz,et al.  Embedding trees in the rationals. , 1970, Proceedings of the National Academy of Sciences of the United States of America.

[4]  R. Halin,et al.  Über unendliche Wege in Graphen , 1964 .

[5]  J. Baumgartner.  Results and independence proofs in combinatorial set theory , 1970 .