Rigidity of expanders and pseudorandom graphs

Michael Krivelevich, Alan Lew, Peleg Michaeli

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in ${\mathbb{R}}^d$, the only continuous motions of the vertices preserving the distances between al…