Title

Discovering New Intrinsically Knotted Graphs Nancy Moore and Michael Wade

Document Type

Article

Publication Date

2008

Abstract

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.

Advisor

Ramin Naimi

Department

math

Support

Howard Hughes Medical Institute Undergraduate Science Education Grant to NM, Occidental College Summer Research Program Fellowship to MW

This document is currently not available here.

Share

COinS