Graphs of 20 edges are 2-apex, hence unknotted

Abstract

A graph is 2-apex if it is planar after the deletion of at most two vertices. Such graphs are not intrinsically knotted, IK. We investigate the converse, does not IK imply 2-apex? We determine the simplest possible counterexample, a graph on nine vertices and 21 edges that is neither IK nor 2-apex. In the process, we show that every graph of 20 or fewer edges is 2-apex. This provides a new proof that an IK graph must have at least 21 edges. We also classify IK graphs on nine vertices and 21 edges and find no new examples of minor minimal IK graphs in this set.

22 pages, 8 figures

Cited by in corpus (8)

• On intrinsically knotted or completely 3-linked graphs
• Many, many more intrinsically knotted graphs
• Graphs on 21 edges that are not 2--apex
• Maximal knotless graphs
• Intrinsically knotted graphs with 21 edges
• The $K_{n+5}$ and $K_{3^2,1^n}$ families are obstructions to $n$-apex
• Constructions stemming from non-separating planar graphs and their Colin de Verdière invariant
• More intrinsically knotted graphs with 22 edges and the restoring method