A graph is intrinsically knotted if there exists a knotted cycle in every spatial embedding of the graph. Using the restoring method, Kim, Mattman, and Oh construct a complete listing of intrinsically knotted bipartite graphs with 22 edges. In this study, we adapt their strategy to show the Heawood graph is the only intrinsically knotted bipartite graph with 21 edges.
Presenting
Primary Speaker
Faculty Sponsors
Abstract Details
Faculty Department/Program
Faculty Division
Presentation Type
Do You Approve this Abstract?
Approved