Intrinsically Knotted Graphs

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

In 1983, Conway and Gordon proved that for every 3D embedding of (the complete graph on seven points), at least one of the 7-cycles 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 3-cycles.


Contributed by: Ed Pegg Jr (March 2011)
Open content licensed under CC BY-NC-SA



The 23 given point embeddings have the property that no set of four points is on a plane.

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.