Volume 11, issue 2 (2011)

Download this article
Download this article For screen
For printing
Recent Issues

Volume 24
Issue 6, 2971–3570
Issue 5, 2389–2970
Issue 4, 1809–2387
Issue 3, 1225–1808
Issue 2, 595–1223
Issue 1, 1–594

Volume 23, 9 issues

Volume 22, 8 issues

Volume 21, 7 issues

Volume 20, 7 issues

Volume 19, 7 issues

Volume 18, 7 issues

Volume 17, 6 issues

Volume 16, 6 issues

Volume 15, 6 issues

Volume 14, 6 issues

Volume 13, 6 issues

Volume 12, 4 issues

Volume 11, 5 issues

Volume 10, 4 issues

Volume 9, 4 issues

Volume 8, 4 issues

Volume 7, 4 issues

Volume 6, 5 issues

Volume 5, 4 issues

Volume 4, 2 issues

Volume 3, 2 issues

Volume 2, 2 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Subscriptions
 
Submission Guidelines
Submission Page
Policies for Authors
Ethics Statement
 
ISSN 1472-2739 (online)
ISSN 1472-2747 (print)
Author Index
To Appear
 
Other MSP Journals
Graphs of $20$ edges are $2$–apex, hence unknotted

Thomas W Mattman

Algebraic & Geometric Topology 11 (2011) 691–718
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
spatial graph, intrinsic knotting, apex graph
Mathematical Subject Classification 2000
Primary: 05C10
Secondary: 57M15
References
Publication
Received: 29 October 2009
Accepted: 15 October 2010
Published: 11 March 2011
Authors
Thomas W Mattman
Department of Mathematics and Statistics
California State University at Chico
Chico CA 95929-0525
USA