All graphs have tree-decompositions displaying their topological ends

Johannes Carmesin

doi:10.1007/s00493-018-3572-0

All graphs have tree-decompositions displaying their topological ends

Johannes Carmesin

Mathematics

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

2 Citations (Scopus)

243 Downloads (Pure)

Abstract

We show that every connected graph has a spanning tree that displays all its topological ends. This proves a 1964 conjecture of Halin in corrected form, and settles a problem of Diestel from 1992.

Original language	English
Pages (from-to)	545-596
Number of pages	52
Journal	Combinatorica
Volume	39
Issue number	3
Early online date	13 Mar 2019
DOIs	https://doi.org/10.1007/s00493-018-3572-0
Publication status	Published - Jun 2019

Keywords

math.CO
05C63, 05B35

Access to Document

10.1007/s00493-018-3572-0

Carmesin_All_Graphs_tree-decompositions_Combinatorica_2018
Checked for eligibility: 16/08/2018 This is the accepted manuscript for a forthcoming publication in Combinatorica.
Accepted author manuscript, 576 KBLicence: None: All rights reserved

https://arxiv.org/abs/1409.6640

Cite this

@article{26a95df687e140e497fab5cd1a74c7c7,

title = "All graphs have tree-decompositions displaying their topological ends",

abstract = "We show that every connected graph has a spanning tree that displays all its topological ends. This proves a 1964 conjecture of Halin in corrected form, and settles a problem of Diestel from 1992. ",

keywords = "math.CO, 05C63, 05B35",

author = "Johannes Carmesin",

year = "2019",

month = jun,

doi = "10.1007/s00493-018-3572-0",

language = "English",

volume = "39",

pages = "545--596",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - All graphs have tree-decompositions displaying their topological ends

AU - Carmesin, Johannes

PY - 2019/6

Y1 - 2019/6

N2 - We show that every connected graph has a spanning tree that displays all its topological ends. This proves a 1964 conjecture of Halin in corrected form, and settles a problem of Diestel from 1992.

AB - We show that every connected graph has a spanning tree that displays all its topological ends. This proves a 1964 conjecture of Halin in corrected form, and settles a problem of Diestel from 1992.

KW - math.CO

KW - 05C63, 05B35

UR - https://www.scopus.com/pages/publications/85062978858

U2 - 10.1007/s00493-018-3572-0

DO - 10.1007/s00493-018-3572-0

M3 - Article

SN - 0209-9683

VL - 39

SP - 545

EP - 596

JO - Combinatorica

JF - Combinatorica

IS - 3

ER -

All graphs have tree-decompositions displaying their topological ends

Abstract

Keywords

Access to Document

Fingerprint

Cite this