Intrinsically Knotted Graphs
Wolfram Demonstrations Project · 2008
In 1983 Conway and Gordon proved that for every 3D embedding of the complete graph on seven points at least one of the 7cycles would be knotted The graph is thus called an intrinsically knotted graph Similarly the graph is intrinsically linked because it will always contain two linked 3cycles