2011/09/05 by Jonathan Miller, Ramin Naimi, Miller, Jonathan +1
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Geometric Topology (math.GT) #math.CO #math.GT
paper · pdf · doi:10.48550/arxiv.1109.1030
9 pages, 4 figures
arxiv created 2013/10/09 · arxiv updated 2013/10/10
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.