Changes
/* Remarks */
In <ref> L. Petingi, J. Rodriguez, Bounds on the maximum number of edge-disjoint Steiner trees of a graph, Congressus Numerantium 145 (2000) 43-52
<ref/ref>, Petingi and Rodriguez prove that if ''G'' is ''k''-edge-connected in ''T'' and <math>\vert T\vert\geq 2</math>, then ''G'' contains at least <math>\lfloor(\frac{2}{3})^{\vert V-T\vert}k/2 \rfloor</math> edge-disjoint Steiner trees for ''T''.
Matthias Kriesell <ref> M. Kriesell, Edge disjoint trees containing some given vertices in a graph, Journal of Combinatorial Theory B 88 (2003), 53-65.
