Bipartite Intrinsically Knotted Graphs with 21 Edges

Author

Shizhe Li, Union College - Schenectady, NYFollow

Date of Award

6-2023

Document Type

Union College Only

Department

Mathematics

First Advisor

Brenda Johnson

Language

English

Keywords

Knots, Graphs, topology

Abstract

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.

Recommended Citation

Li, Shizhe, "Bipartite Intrinsically Knotted Graphs with 21 Edges" (2023). Honors Theses. 2721.
https://digitalworks.union.edu/theses/2721