Linkages in Large Graphs of Bounded Tree-Width
Combinatorics
2014-02-25 v1
Abstract
We show that all sufficiently large (2k+3)-connected graphs of bounded tree-width are k-linked. Thomassen has conjectured that all sufficiently large (2k+2)-connected graphs are k-linked.
Keywords
Cite
@article{arxiv.1402.5549,
title = {Linkages in Large Graphs of Bounded Tree-Width},
author = {Jan-Oliver Fröhlich and Ken-ichi Kawarabayashi and Theodor Müller and Julian Pott and Paul Wollan},
journal= {arXiv preprint arXiv:1402.5549},
year = {2014}
}
Comments
68 pages, 1 figure