Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(online) ISSN 0002-9939(print)

 

An end-faithful spanning tree counterexample


Authors: Paul Seymour and Robin Thomas
Journal: Proc. Amer. Math. Soc. 113 (1991), 1163-1171
MSC: Primary 05C05; Secondary 03E35
MathSciNet review: 1045600
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: 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 Širáň.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 05C05, 03E35

Retrieve articles in all journals with MSC: 05C05, 03E35


Additional Information

DOI: http://dx.doi.org/10.1090/S0002-9939-1991-1045600-8
PII: S 0002-9939(1991)1045600-8
Article copyright: © Copyright 1991 American Mathematical Society