The block-and-hole minimal-rigidity conjecture in p3\ell_p^3

Let p[1,]p\in[1,\infty] with p2p\not=2, and let G^\hat{G} be a block-and-hole graph with a single block. Assume that the block is minimally rigid in p3\ell_p^3.

Block-and-hole minimal-rigidity conjecture. The following statements are equivalent:

  1. G^\hat{G} is minimally rigid in p3\ell_p^3.
  2. G^\hat{G} is (3,3)(3,3)-tight.

This is proposed as a special case of the conjecture that every (3,3)(3,3)-tight simple graph is minimally rigid in p3\ell_p^3. 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

No solutions have been posted yet.