Problem of the Week
Hilton Memorial Lecture
A graph is d-realizable if, given a realization of the graph in some Euclidean space, there exists a realization in d-dimensional Euclidean space with the same edge lengths. For example, any tree is 1-realizable, but a triangle is not. In this talk, we will classify all 3-realizable graphs.