The block-and-hole minimal-rigidity conjecture in
The block-and-hole minimal-rigidity conjecture in
Let with , and let be a block-and-hole graph with a single block. Assume that the block is minimally rigid in .
Block-and-hole minimal-rigidity conjecture. The following statements are equivalent:
- is minimally rigid in .
- is -tight.
This is proposed as a special case of the conjecture that every -tight simple graph is minimally rigid in . The statement remains open.
Sources & referencesView supporting material
Primary source
Bryan Gin-ge Chen, James Cruickshank and Derek Kitson, “Block-and-hole graphs: Constructibility and (3,0)-sparsity”, arXiv:2309.06804 (2023).
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.