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.
math.CO↗
arXiv subjects
Theodor Müller
Publications and source records attributed to Theodor Müller.
Linear Connectivity Forces Large Complete Bipartite Minors: the Patch for the Large Tree-Width Case
The recent paper "Linear Connectivity Forces Large Complete Bipartite Minors" by Boehme et al. relies on a structure theorem for graphs with no H-minor. The sketch provided of how to deduce this theorem from the work of Robertson and Seymour appears to be incomplete. To fill this gap, we modify the main proof of that paper to work with a mere restatement of Robertson and Seymour's original results instead.
math.CO↗