Linkages in Large Graphs of Bounded Tree-Width
  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. 
Jan-Oliver Fr\"ohlich, Ken-ichi Kawarabayashi, Theodor M\"uller,   Julian Pott, Paul Wollan
math.CO