Bipartite Intrinsically Knotted Graphs with 21 Edges
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 edgesSimilar works
Full text
Last time updated on 17/10/2023
This paper was published in Union College: Union | Digital Works.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.