The University of Michigan Combinatorics Seminar


Abstract 

Given an edgeweighted graph and a number d, is it possible to place the vertices of the graph in ddimensional Euclidean space so that the distance between adjacent points is equal to the prescribed weight? I am planning to discuss two results about this problem. The first result is constructive and has a transparent mechanical interpretation, whereas the second result, while being only epsilon stronger, is nonconstructive and has a mysterious mechanical interpretation. 