  In this note, we provide a new proof that a $D$-connected graph $G$ on $n$
vertices has a general position orthogonal representation in $\RR^{n-D}$. Our
argument, while based on many of the concepts from the original proof due to
Lov\'asz, Saks and Schrijver, does not use the probabilistic method.
