Linkages in Large Graphs of Bounded Tree-Width

Jan-Oliver Fr\"ohlich , Ken-ichi Kawarabayashi , Theodor M\"uller , Julian Pott , Paul Wollan

Authors on Pith no claims yet

classification 🧮 math.CO

keywords graphslargeboundedconnectedk-linkedsufficientlytree-widthconjectured

read the original 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.

This paper has not been read by Pith yet.

Linkages in Large Graphs of Bounded Tree-Width

discussion (0)