engelsma@buster.cps.msu.edu (Engelsma Jonathan) (10/31/90)
I've been told the following has been proven: Given a graph G, any two vertices u and v, and a maximum spanning tree T. Let e be an edge with minimum weight w(e) on the path from u to v in T. For any maximum spanning tree T' of G there will be a minimal edge e' on the path from u to v such that w(e') = w(e). Could somebody please give me a reference to where this proof was published. Please e-mail your responses directly to me and if there is enough interest I'll post a summary of responses. Thanks in advance, Jonathan ------------------------------------------------------------------------- Jonathan R. Engelsma Michigan State University E-mail: engelsma@buster.cps.msu.edu Department of uunet!frith!engelsma Computer Science uunet!frith!jresys!engelsma (home) -------------------------------------------------------------------------