Changes
The existence of ''k'' edge-disjoint spanning trees is characterized by [[Tutte's disjoint tree theorem]], while the existence of ''l'' edge-disjoint ''s-t'' paths is characterized by [[Wikipedia:Menger's theorem|Menger's theorem]].
The problem is a very special case of the more difficult Steiner tree packing problem with different terminal sets, discussed by Grötschel, Martin and Wismantel Weismantel <ref>M. Grötschel, A. Martin, R. Weismantel, ''Packing Steiner trees: polyhedral investigations'', [http://dx.doi.org/10.1007/BF02592085 DOI link].</ref>. '''The problem is NP-complete even for ''k=l=''1. The proof will be available soon.'''
==References==
