We show that there is a straight line embedding of the complete graph \(K_C\) into \(\mathcal{R}^3\) which is space-filling: every point of \(\mathcal{R}^3\) is either one of the vertices of \(K_C\), or lies on exactly one straight line segment joining two of the vertices.
Citation
J. Ginsburg, V. Linek. A Space-Filling Complete Graph[J], Ars Combinatoria, Volume 058. 97-109. .