The Smallest Bipartite Intrinsically Knotted Graph

Authors

  • Brenda Johnson Union College
  • Shizhe Li Stanford University

DOI:

https://doi.org/10.46787/pump.v7i0.4028

Keywords:

intrinsically knotted graph; bipartite graph; graph embedding

Abstract

We use the restoring method of Kim, Mattman, and Oh  to prove that the Heawood graph is the only bipartite graph with 21 edges that is intrinsically knotted.

Downloads

Published

2024-12-04

How to Cite

Johnson, B., & Li, S. (2024). The Smallest Bipartite Intrinsically Knotted Graph. The PUMP Journal of Undergraduate Research, 7, 333–354. https://doi.org/10.46787/pump.v7i0.4028

Issue

Vol. 7 (2024): PUMP Journal of Undergraduate Research

Section

Articles

License

Copyright (c) 2024 Brenda Johnson, Shizhe Li

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

The author(s) will retain the copyright, but by submitting the article agree to grant permission to the PUMP Journal of Undergraduate Research to publish, distribute, and archive the article. The author(s) will acknowledge prior publication in the PUMP Journal of Undergraduate Research for all future uses of the article or parts of it.