An end-faithful spanning tree counterexample

Paul Seymour; Robin Thomas

doi:10.1090/S0002-9939-1991-1045600-8

An end-faithful spanning tree counterexample

Paul Seymour, Robin Thomas

Research output: Contribution to journal › Article › peer-review

3 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 language	English (US)
Pages (from-to)	709-716
Number of pages	8
Journal	Proceedings of the American Mathematical Society
Volume	111
Issue number	4
DOIs	https://doi.org/10.1090/S0002-9939-1991-1045600-8
State	Published - Dec 1991
Externally published	Yes

All Science Journal Classification (ASJC) codes

General Mathematics
Applied Mathematics

Access to Document

10.1090/S0002-9939-1991-1045600-8

Cite this

@article{4cd851c7915149b086159389cdc6c22d,

title = "An end-faithful spanning tree counterexample",

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{\'a}n.",

author = "Paul Seymour and Robin Thomas",

year = "1991",

month = dec,

doi = "10.1090/S0002-9939-1991-1045600-8",

language = "English (US)",

volume = "111",

pages = "709--716",

journal = "Proceedings of the American Mathematical Society",

issn = "0002-9939",

publisher = "American Mathematical Society",

number = "4",

}

TY - JOUR

T1 - An end-faithful spanning tree counterexample

AU - Seymour, Paul

AU - Thomas, Robin

PY - 1991/12

Y1 - 1991/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84967735780&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84967735780&partnerID=8YFLogxK

U2 - 10.1090/S0002-9939-1991-1045600-8

DO - 10.1090/S0002-9939-1991-1045600-8

M3 - Article

AN - SCOPUS:84967735780

SN - 0002-9939

VL - 111

SP - 709

EP - 716

JO - Proceedings of the American Mathematical Society

JF - Proceedings of the American Mathematical Society

IS - 4

ER -

An end-faithful spanning tree counterexample

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this