We present three results which support the conjecture that a graph is minimally rigid in d-dimensional ℓ p -space, where p ∈ ( 1 , ∞ ) and p ≠ 2 , if and only if it is (d, d)-tight. Firstly, we introduce a graph bracing operation whi... ...
