Question 59
A weighted complete graph with distinct positive weights is given such that every triangle is degenerate, i.e., the weight of one of the edges is equal to the sum of the two others. Prove that one can assign values to the vertices of this graph such that the weight of each edge is equal to the difference between the values assigned to its endpoints.