The Smallest Bipartite Intrinsically Knotted Graph

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.

Authors

Institutions

Publication Details

Journal
The PUMP Journal of Undergraduate Research
Published
2024-12-04
DOI
https://doi.org/10.46787/pump.v7i0.4028
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Smallest Bipartite Intrinsically Knotted Graph

Brenda Johnson, Shizhe Li
1 links
The PUMP Journal of Undergraduate Research
Computational Geometry and Mesh Generation
article

The Smallest Bipartite Intrinsically Knotted Graph

Brenda Johnson, Shizhe Li
article en

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.

The PUMP Journal of Undergraduate ResearchVol. 7
Union College (US), Stanford University (US)
Openalex Percentile: Top 56%
Computational Geometry and Mesh Generation
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The Smallest Bipartite Intrinsically Knotted Graph — Brenda Johnson, Shizhe Li · The PUMP Journal of Undergraduate Research (2024) | TGRS Research Map | TGRS