Graphs of 20 edges are 2-apex, hence unknotted
Geometric Topology
2014-10-01 v1
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.
Keywords
Cite
@article{arxiv.0910.1575,
title = {Graphs of 20 edges are 2-apex, hence unknotted},
author = {Thomas W. Mattman},
journal= {arXiv preprint arXiv:0910.1575},
year = {2014}
}
Comments
22 pages, 8 figures