A universal threshold for geometric embeddings of trees

Dylan J. Altschuler, Pandelis Dodos, Konstantin Tikhomirov +1

A graph $G=(V,E)$ is geometrically embeddable into a normed space $X$ when there is a mapping $\zeta :V\to X$ such that $\Vert \zeta (v)-\zeta (w){\Vert }_X⩽1$ if and only if $\{v,w\}\in E$, for…