A graph is k-realizable if any set of distances realizable in R^n for some n can be realized in R^k. The pairs of points where the distances are specified are given by the edges of the graph. I will discuss a (speculative) conjecture about k-realizability and universal rigidity and provide some evidence for it.