Intrinsically Linked

A graph is intrinsically linked if any embedding of it in three dimensions contains a nontrivial link. A graph is intrinsically linked iff it contains one of the seven Petersen graphs (Robertson et al. 1993).

The complete graph (left) is intrinsically linked because it contains at least two linked triangles. The complete k-partite graph (right) is also intrinsically linked.

Wolfram Web Resources

Mathematica » The #1 tool for creating Demonstrations and anything technical.	Wolfram\|Alpha » Explore anything with the first computational knowledge engine.	Wolfram Demonstrations Project » Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.
Computerbasedmath.org » Join the initiative for modernizing math education.	Online Integral Calculator » Solve integrals with Wolfram\|Alpha.	Step-by-step Solutions » Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.
Wolfram Problem Generator » Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.	Wolfram Education Portal » Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.	Wolfram Language » Knowledge-based programming for everyone.