The E2Xs511/E2Vs511 doubling conjecture for minimally 3-rigid graphs

Let GG be a minimally 3-rigid graph, and let GG' be obtained from GG by a 1-extension of type E2Xs511 or E2Vs511. Let c3(G)\mathbf{c}_{3}(G) denote the three-dimensional realization count. The E2Xs511/E2Vs511 doubling conjecture. Then

c3(G)c3(G)=2.\frac{\mathbf{c}_{3}(G')}{\mathbf{c}_{3}(G)}=2.

The claim is supported by computations for graphs with at most nine vertices, where these extension types always produced a factor of two. Its unrestricted validity is not established in the supplied text.

Sources & referencesView supporting material

Primary source

Georg Grasegger, “Explorations on the number of realizations of minimally rigid graphs”, arXiv:2502.04736 (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.