Laman's theorem

Theorem (Laman ). A graph G=(V,E) is minimally rigid in 2 dimensions if and only if $$|E|=2|V|-3$$ and $$i_G(X) \leq 2|X|-3$$ for every $$X \subseteq V$$ of size at least 2.