Date of Award
Union College Only
Knots, Graphs, topology
A graph is intrinsically knotted if there exists a knotted cycle in every spatial embedding of the graph. Using the restoring methods, 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.
Li, Shizhe, "Bipartite Intrinsically Knotted Graphs with 21 Edges" (2023). Honors Theses. 2721.