Discovering New Intrinsically Knotted Graphs Nancy Moore and Michael Wade
Nancy B. Moore, Michael Wade · Occidental College Scholar (Occidental College) · 2008
In the field of topology, intrinsically knotted graphs are rare graphs in which all embeddings contain a nontrivial knot. There are a finite number of these graphs and only a handful of graphs have been proven to be intrinsically knotted; the last one being in 2005. We adapted a known method for proving intrinsic knottedness, and applied it to graphs we had created. During our research John Miller wrote a new computer program for testing if a graph was new.By using these resources, we demonstrated the existence of two new intrinsically knotted graphs.