A sufficient condition for a graph to be weakly k-linked (Q790839)

Let \((s_ i,t_ i)\), \(i=1,2,3\), be pairs of vertices of a graph. Then the authors prove the following theorem: If the number of edge-disjoint paths between \(s_ i\) and \(t_ i\), \(i=1,2,3\), is at least \(2k+1\), \(k>2\), then there exist \(2k+1\) edge-disjoint paths such that one connects \(s_ 1\) and \(t_ 1\), another \(s_ 2\) and \(t_ 2\) and the others \(s_ 3\) and \(t_ 3\). It follows a corollary: Every \((2k+1)\)-edge-connected graph is weakly \((k+2)\)-linked for \(k\geq 2\). Where a graph is weakly k- linked if for any k vertex pairs \((s_ i,t_ i)\), 1\(\leq i\leq k\), there exist k edge-disjoint paths \(P_ 1,...,P_ k\) such that \(P_ i\) joins \(s_ i\) and \(t_ i\) for \(i=1,...,k\). [For related work, see i.e. \textit{C. Thomassen}, Europ. J. Comb. 1, 371-378 (1980; Zbl 0457.05044).]