Portal de Periódicos da CAPES

An end-faithful spanning tree counterexample

1991; American Mathematical Society; Volume: 113; Issue: 4 Linguagem: Inglês

10.1090/s0002-9939-1991-1045600-8

1088-6826

Paul Seymour, Robin Thomas,

Markov Chains and Monte Carlo Methods

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áň.