Talk:Edge-disjoint spanning trees and paths
From Egres Open
The proof for k=l=1 was wrong so I removed it -- Tamás Király 17:16, 8 March 2010 (UTC)
The proof that I had written earlier for the k=l=1 case in the remarks was wrong, so I removed it. A node set [math]X \subseteq V\setminus \{s,t\}[/math] of in-degree 2 cannot be deleted, because we may want to use both entering edges in the spanning tree.
