Work

The Smallest Bipartite Intrinsically Knotted Graph

Year: 2024

Type: article

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.

Source: The PUMP Journal of Undergraduate Research

DOI: 10.46787/pump.v7i0.4028

Authors: Brenda Johnson, Shizhe Li

Institutions: Union College, Stanford University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4405025934

FWCI:

Cites:

Cited by:

Related to: 10