The dimension of a graph $G$ is the minimal $n$ such that $G$ can be embedded in ${\mathbb{R}}^n$ such that every edge of $G$ is a unit line segment.What is the smallest number of edges in a graph with dimension $4$?