LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K7
Abstract
In 1983 Conway and Gordon and Sachs proved that every embedding of the complete graph on six vertices, K6, is intrinsically linked. In 2004 it was shown that all straight-edge embeddings of K6 have either one or three linked triangle pairs. We expand this work to characterize the straight-edge embeddings of K7 and determine the number and types of links in every embedding which forms a convex polyhedron of seven vertices.