An exact formula for the expected length of the minimum spanning
tree of a connected graph with independent and identical edge
distribution is given, which generalizes Steele's formula in the
uniform case. For the complete graph, the difference of expected lengths
between exponential with rate one and uniform on (0,1) is shown to
be positive and of rate zeta(3)/n. This is a joint work with Dr. Wenbo Li.
