Graphs of 20 edges are 2-apex, hence unknotted

DOI10.2140/AGT.2011.11.691MaRDI QIDQ631332zbMATH OpenOpenAlexFDO

Authors T. Mattman

Publication date 23 March 2011

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

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

zbMATH Keywords

spatial graphapex graphintrinsic knotting

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

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.

Recommendations

• Graphs on 21 edges that are not 2-apex
• More intrinsically knotted graphs with 22 edges and the restoring method
• Exactly fourteen intrinsically knotted graphs have 21 edges
• A new intrinsically knotted graph with 22 edges
• Maximal knotless graphs

Cites work

• scientific article; zbMATH DE number 3906521 (Why is no real title available?)
• scientific article; zbMATH DE number 125433 (Why is no real title available?)
• scientific article; zbMATH DE number 4183465 (Why is no real title available?)
• INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES
• Intrinsic knotting and linking of almost complete graphs
• On intrinsically knotted or completely 3-linked graphs
• Primitive spatial graphs and graph minors
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS

Cited in

(11)

• A new intrinsically knotted graph with 22 edges
• Recent developments in spatial graph theory
• Dips at small sizes for topological graph obstruction sets
• More intrinsically knotted graphs with 22 edges and the restoring method
• Many, many more intrinsically knotted graphs
• Graphs on 21 edges that are not 2-apex
• Bipartite intrinsically knotted graphs with 22 edges
• Maximal knotless graphs
• The \(K_{n+5}\) and \(K_{3^2,1^n}\) families and obstructions to \(n\)-apex.
• Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant
• Bipartite intrinsically knotted graphs with 23 edges

This page was built for publication: Graphs of 20 edges are 2-apex, hence unknotted

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