Giro et al.'s conjecture on reconstructing a positive fraction of points

Let f:[n]Rf:[n]\rightarrow\mathbb{R} be an arbitrary injective function, and let ε>0\varepsilon>0. For a random graph GG(n,p)G\sim G(n,p) with p(1+ε)/np\geq(1+\varepsilon)/n, a subset V[n]V'\subseteq[n] is sought such that the restricted framework (G[V],fV)(G[V'],f|_{V'}) is globally rigid in R\mathbb{R}.

Giro et al.'s reconstruction conjecture. For every ε>0\varepsilon>0 and every p(1+ε)/np\geq(1+\varepsilon)/n, with high probability there exists a subset V[n]V'\subseteq[n] of size V=Ωε(n)|V'|=\Omega_{\varepsilon}(n) such that (G[V],fV)(G[V'],f|_{V'}) is globally rigid in R\mathbb{R}.

This conjecture asks whether the threshold 1/n1/n for the emergence of the giant 2-connected component is also the threshold for reconstructing a positive fraction of the points of any injective embedding. The paper proves a stronger near-spanning result at a suitable constant multiple of 1/n1/n, but the stated conjecture remains open.

Sources & referencesView supporting material

Primary source

Richard Montgomery, Rajko Nenadov, Julien Portier and Tibor Szabó, “Global rigidity of random graphs in R”, arXiv:2401.10803 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.