Affiliation:
1. Department of Math and Computer Science, Denison University, Granville, OH 43023, USA
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.
Publisher
World Scientific Pub Co Pte Lt
Subject
Algebra and Number Theory
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献