navbar-top.gif
btn_spacer.gifHomeTopicsLatestRandomAboutFAQsParticipateAuthoring Areabtn_spacer.gif

Intrinsically Knotted Graphs

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.

The 23 given point embeddings have the property that no set of four points is on a plane.
Free Download: Mathematica Player--Runs all Demonstrations & more


Share & Bookmark This Demonstration


Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »

©  2008 The Wolfram Demonstrations Project & Contributors    Wolfram Research    Site Index    Terms of Use    Privacy Policy    RSS    Atom