Wolfram Research  Mathematica    MathWorld    Wolfram Science    More »    Wolfram Web Resources
HOME
TOPICS
LATEST
ABOUT
FAQS
PARTICIPATE
AUTHORING AREA

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.


"Intrinsically Knotted Graphs" from The Wolfram Demonstrations Project
 http://demonstrations.wolfram.com/IntrinsicallyKnottedGraphs/
Contributed by: Ed Pegg Jr
comments
Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now
Related Topics

Some Related Demonstrations

Share & Bookmark This Demonstration

Contribute

 
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. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »
Note: To run this Demonstration you need the free
Mathematica Player or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+