Conjecture on global rigidity of 2-edge-apex graphs

At least 1 year old · documented by

Let G=(V,E)G=(V,E) be a graph. A framework is globally R3\mathcal{R}_3-rigid if every framework in R3\mathbb{R}^3 with the same edge lengths differs from it by a composition of isometries. The graph GG is 2-edge-apex if deleting two edges makes it planar. Then GG is globally R3\mathcal{R}_3-rigid if and only if GG is 4-connected and

G−e is R3-rigid for all edges e∈E.G-e\text{ is }\mathcal{R}_3\text{-rigid for all edges }e\in E.

This would extend the preceding characterization from edge-apex graphs to 2-edge-apex graphs. The supplied text provides no proof or resolution of the assertion.

References

Primary source

Sean Dewar, Georg Grasegger, Eleftherios Kastis, Anthony Nixon and Brigitte Servatius, “Rigidity of nearly planar classes of graphs”, arXiv:2402.17499 (2024).

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.