Im sorry but the : is not suppose to be there at the end
This proof was done in class and will be on the test on Friday but I just don't understand it. Can someone save me please. Thank you.
1) Prove that if T1, T2 and T3 are spanning trees of a simple connected graph G then:
d(T1, T3) <= d(T1, T2) + d(T2, T3):
His way is CRAAAAAAAAAAZY it took up a front of a page and half of the back.
I rather learn your way which I can actually understand.
So let me give this a shot
The S_1,S_2,S_3 are basically the T_1,T_2,T_3.
Then we get the formula you got.
Next we plug that into a venn diagram
Is this venn diagram containing three circles one for each S_i.
Therefore the middle of S_1 S_2 will be shaded plus S_2 S_3
This shows that S_2 must be greater than the other two.
Is that the logic.