The E2Xs511/E2Vs511 doubling conjecture for minimally 3-rigid graphs
The E2Xs511/E2Vs511 doubling conjecture for minimally 3-rigid graphs
Let be a minimally 3-rigid graph, and let be obtained from by a 1-extension of type E2Xs511 or E2Vs511. Let denote the three-dimensional realization count. The E2Xs511/E2Vs511 doubling conjecture. Then
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.