A Space-Filling Complete Graph

J. Ginsburg1, V. Linek1
1University of Winnipeg Winnipeg, Manitoba Canada R3B 2E9

Abstract

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.