Changes

Let ''G=(V,E)'' be a graph, and <math>T \subseteq V</math>. Is it true that if ''GT'' is ''2k''-edge-connected in ''TG'' (i.e. there are ''2k'' edge-disjoint paths between any two nodes of ''T''), then ''G'' contains ''k'' edge-disjoint [[wikipedia:Steiner_tree|Steiner tree]]s for ''T''?