An Algorithm for Detecting Intrinsically Knotted Graphs

Details An Algorithm for Detecting Intrinsically Knotted Graphs An Algorithm for Detecting Intrinsically Knotted Graphs

2011-09-05

arxiv.org/abs/1109.1030v1

Mathematics

Geometric Topology

9 pages, 4 figures

Scientific paper

We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by Goldberg, Mattman, and Naimi [6] to greatly expand the list of known minor minimal IK graphs, and to find knotless embeddings for some graphs that had previously resisted attempts to classify them as IK or non-IK.

Affiliated with

Also associated with

No associations

Rating

An Algorithm for Detecting Intrinsically Knotted Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Algorithm for Detecting Intrinsically Knotted Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algorithm for Detecting Intrinsically Knotted Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-92443