Graphs of 20 edges are 2-apex, hence unknotted

Details Graphs of 20 edges are 2-apex, hence unknotted Graphs of 20 edges are 2-apex, hence unknotted

2009-10-08

arxiv.org/abs/0910.1575v1

Mathematics

Geometric Topology

22 pages, 8 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Graphs of 20 edges are 2-apex, hence unknotted does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graphs of 20 edges are 2-apex, hence unknotted, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphs of 20 edges are 2-apex, hence unknotted will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-353239