Exactly fourteen intrinsically knotted graphs have 21 edges (Q907769)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Exactly fourteen intrinsically knotted graphs have 21 edges |
scientific article |
Statements
Exactly fourteen intrinsically knotted graphs have 21 edges (English)
0 references
26 January 2016
0 references
This paper proves that \(K_7\) and the thirteen graphs obtained from it by \(\Delta Y\) moves are the only intrinsically knotted graphs with 21 edges. This is the minimal number of edges a minimally knotted graph can have [\textit{B. Johnson} et al., J. Knot Theory Ramifications 19, No. 11, 1423--1429 (2010; Zbl 1232.57004)]. The result follows from showing that all triangle-free intrinsically knotted graphs with exactly 21 edges are either homeomorphic to \(H_{12}\) or \(C_{14}\) or are 2-apex and therefore not intrinsically knotted.
0 references
intrinsically knotted graphs
0 references