GNRS conjecture

Unsolved problem in mathematics
Do minor-closed graph families have embeddings with bounded distortion?
An isometric embedding of the weighted graph on the left into ℓ₁ space. The taxicab distance between each vertex in the embedding exactly matches the graph distance between vertices in the weighted graph, meaning the stretch factor is 1 (and therefore it is isometric).

In theoretical computer science and metric geometry, the GNRS conjecture connects the theory of graph minors, the stretch factor of embeddings, and the approximation ratio of multi-commodity flow problems. It is named after Anupam Gupta, Ilan Newman, Yuri Rabinovich, and Alistair Sinclair, who formulated it in 2004.