Minimum spannig trees:

The bottleneck edge in a path is the paths maximum-weight edge. A minimax path between two vertices s and t is a path such that no other path between s and t has a lighter bottleneck edge. Prove that any path in a minimum spanning tree of graph G is a minimax path of G.