Changes
Created page with '<onlyinclude> In a graph ''G=(V,E)'' with a root node ''r'', two spanning trees <math>T_1</math> and <math>T_2</math> are called ''r''-'''independent''' if for any node ''x'' in …'
<onlyinclude>
In a graph ''G=(V,E)'' with a root node ''r'', two spanning trees <math>T_1</math> and <math>T_2</math> are called ''r''-'''independent''' if for any node ''x'' in ''V-r'', the unique paths between ''r'' and ''x'' in ''T_1'' and ''T_2''
are internally node disjoint. Is it true that if ''G'' is ''k''-connected then ther exist ''k'' ''r''-independent trees
for arbitrary ''r''?
</onlyinclude>
==Remarks==
Lesz bőven.
In a graph ''G=(V,E)'' with a root node ''r'', two spanning trees <math>T_1</math> and <math>T_2</math> are called ''r''-'''independent''' if for any node ''x'' in ''V-r'', the unique paths between ''r'' and ''x'' in ''T_1'' and ''T_2''
are internally node disjoint. Is it true that if ''G'' is ''k''-connected then ther exist ''k'' ''r''-independent trees
for arbitrary ''r''?
</onlyinclude>
==Remarks==
Lesz bőven.
