The E1s63 doubling conjecture for minimally 3-rigid graphs

About 1 year old · traced to

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

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

The conjecture is motivated by experiments in which E1s63 extensions always doubled the number of realizations. The supplied text does not establish the claim for all minimally 3-rigid graphs.

References

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.