The globally rigid graph bridge conjecture

Let GG be a globally rigid graph in Rd\mathbb{R}^d, and let ee be an edge such that GeG-e is not globally rigid. An edge is an Rd+1\mathcal{R}_{d+1}-bridge when its deletion lowers the rank of the (d+1)(d+1)-dimensional rigidity matroid. The globally rigid graph bridge conjecture. Under these hypotheses, ee is an Rd+1\mathcal{R}_{d+1}-bridge in GG. This is the globally rigid specialization of the linked-pairs dimension-dropping conjecture and remains open here.

Sources & referencesView supporting material

Primary source

Dániel Garamvölgyi and Tibor Jordán, “Minimally globally rigid graphs”, arXiv:2202.11617 (2022).

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.