An end-faithful spanning tree counterexample

Paul Seymour, Robin Thomas

Research output: Contribution to journalArticle

2 Scopus citations

Abstract

We find an infinitely-connected graph in which every spanning tree has a 2-wayinfinite path. This disproves Halin′s well-known "end-faithful spanning tree" conjecture and also disproves a recent conjecture of Sirán.

Original languageEnglish (US)
Pages (from-to)709-716
Number of pages8
JournalProceedings of the American Mathematical Society
Volume111
Issue number4
DOIs
StatePublished - Dec 1991
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Applied Mathematics

Fingerprint Dive into the research topics of 'An end-faithful spanning tree counterexample'. Together they form a unique fingerprint.

  • Cite this