Exactly fourteen intrinsically knotted graphs have 21 edges

Minjung Lee, Hyoungjun Kim, Hwa Jeong Lee, Seung Sang Oh

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Johnson, Kidwell, and Michael showed that intrinsically knotted graphs have at least 21 edges. Also it is known that K7 and the thirteen graphs obtained from K7 by ∇Y moves are intrinsically knotted graphs with 21 edges. We prove that these 14 graphs are the only intrinsically knotted graphs with 21 edges.

Original languageEnglish
Pages (from-to)3305-3322
Number of pages18
JournalAlgebraic and Geometric Topology
Volume15
Issue number6
DOIs
Publication statusPublished - 2016 Jan 12

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'Exactly fourteen intrinsically knotted graphs have 21 edges'. Together they form a unique fingerprint.

  • Cite this