Independent trees
Statement
In a graph G=(V,E) with a root node r, two spanning trees and are called r-independent if for any node x in V-r, the unique paths between r and x in and are internally node disjoint. Is it true that if G is k-connected then there exist k r-independent trees for arbitrary r?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.