The globally rigid graph bridge conjecture
The globally rigid graph bridge conjecture
Let be a globally rigid graph in , and let be an edge such that is not globally rigid. An edge is an -bridge when its deletion lowers the rank of the -dimensional rigidity matroid. The globally rigid graph bridge conjecture. Under these hypotheses, is an -bridge in . 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
Sign in to submit a solution.
No solutions have been posted yet.