Exactly fourteen intrinsically knotted graphs have 21 edges

DOI10.2140/AGT.2015.15.3305MaRDI QIDQ907769zbMATH OpenOpenAlexFDO

Authors Minjung Lee, Hyoungjun Kim, Hwa Jeong Lee, Seungsang Oh

Publication date 26 January 2016

Published in Algebraic \& Geometric Topology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1207.7157

zbMATH Keywords

intrinsically knotted graphs

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15)

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 rY moves are intrinsically knotted graphs with 21 edges. We prove that these 14 graphs are the only intrinsically knotted graphs with 21 edges.

Review text

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.

Recommendations

• More intrinsically knotted graphs with 22 edges and the restoring method
• A new intrinsically knotted graph with 22 edges
• Bipartite intrinsically knotted graphs with 22 edges
• Graphs on 21 edges that are not 2-apex
• Intrinsic knotting and linking of almost complete graphs

Cited in

(14)

• Chirality for simple graphs of size up to 12
• Bipartite intrinsically knotted graphs with 23 edges
• A new intrinsically knotted graph with 22 edges
• The Y-triangle move does not preserve intrinsic knottedness
• Graphs on 21 edges that are not 2-apex
• The minor minimal intrinsically chiral graphs
• Recent developments in spatial graph theory
• Order nine MMIK graphs
• More intrinsically knotted graphs with 22 edges and the restoring method
• Bipartite intrinsically knotted graphs with 22 edges
• Linearly free graphs
• Graphs of 20 edges are 2-apex, hence unknotted
• On intrinsically knotted or completely 3-linked graphs
• The smallest bipartite intrinsically knotted graph

This page was built for publication: Exactly fourteen intrinsically knotted graphs have 21 edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q907769)