Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Please help with the following homework problem:

Let G be an undirected graph, $v: E\to R$ and $w: E\to R$ be two weight functions on the edges of $G$. Let $z: E\to R$ be defined as the sum of $v$ and $w$, i.e. for every edge $e$ of $G$ $z(e)=v(e) + w(e)$. Let $V$, $W$, and $Z$ be the total weights of the minimum weight spanning trees of $G$ with respect to weight functions $v$, $w$ and $z$, respectively. Prove or disprove: $Z \geq V+W$.

After trying a few graphs, I am convinced the that no counter example exists and that the statement is true. Please help me get started on the proof.

share|cite|improve this question
up vote 5 down vote accepted

If this $Z \lt V + W$, then consider the the minimum weight spanning tree for which Z is attained. Let its weight according to v be V' and according to w be W'. $V' + W' \lt V + W$, so either V' < V or W' < W, which is not possible as V and W are the weights for the minimum spanning trees for v and w, respectively.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.