GNRS conjecture

Unsolved problem in mathematics:

Do minor-closed graph families have ${\displaystyle \ell _{1}}$ embeddings with bounded distortion?

(more unsolved problems in mathematics)

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.^[1]