Let S Call Max Weight Spanning Tree T Maximum Weight Edges T Bottleneck Spanning Tree T Sp Q37292492

Let’s call the max-weight of a spanning tree T the maximum weight of the edges of T. A bottleneck spanning tree T is a spanning tree with the smallest max-weight. We say that the value of the bottleneck spanning tree is the weight of the maximum-weight edge in the tree. (a) [10 pts] Prove that a minimum spanning tree is a bottleneck spanning tree. (Hint: one approach is to prove by contradiction.

OR

 

OR