An end-faithful spanning tree counterexample

Paul Seymour, Robin Thomas

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

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

Original languageEnglish (US)
Pages (from-to)321-330
Number of pages10
JournalDiscrete Mathematics
Volume95
Issue number1-3
DOIs
StatePublished - Dec 3 1991
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

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

Cite this