More intrinsically knotted graphs with 22 edges and the restoring method

DOI10.1142/S0218216518500591MaRDI QIDQ4684558zbMATH OpenOpenAlexFDO

Authors Hyoungjun Kim, T. Mattman, Seungsang Oh

Publication date 1 October 2018

Published in Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

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

zbMATH Keywords

graph embeddingintrinsically knotted

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Abstract: A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael, and, independently, Mattman showed that intrinsically knotted graphs have at least 21 edges. Recently Lee, Kim, Lee and Oh, and, independently, Barsotti and Mattman, showed that $K_7$ and the 13 graphs obtained from $K_7$ by $ablaY$ moves are the only intrinsically knotted graphs with 21 edges. Also Kim, Lee, Lee, Mattman and Oh showed that there are exactly three triangle-free intrinsically knotted graphs with 22 edges having at least two vertices of degree 5. Furthermore, there is no triangle-free intrinsically knotted graph with 22 edges that has a vertex with degree larger than 5. In this paper we show that there are exactly five triangle-free intrinsically knotted graphs with 22 edges having exactly one degree 5 vertex. These are Cousin 29 of the $K_{3,3,1,1}$ family, Cousins 97 and 99 of the $E_9+e$ family and two others that were previously unknown.

Recommendations

• A new intrinsically knotted graph with 22 edges
• Exactly fourteen intrinsically knotted graphs have 21 edges
• More intrinsically knotted graphs
• Bipartite intrinsically knotted graphs with 22 edges
• Intrinsic knotting and linking of almost complete graphs

Cites work

• A new intrinsically knotted graph with 22 edges
• Bipartite intrinsically knotted graphs with 22 edges
• Exactly fourteen intrinsically knotted graphs have 21 edges
• Graph minors. XX: Wagner's conjecture
• Graphs of 20 edges are 2-apex, hence unknotted
• Graphs on 21 edges that are not 2-apex
• scientific article; zbMATH DE number 3906521 (Why is no real title available?)
• scientific article; zbMATH DE number 125433 (Why is no real title available?)
• Intrinsically knotted graphs
• INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES
• Knots and links in spatial graphs
• Many, many more intrinsically knotted graphs
• On intrinsically knotted or completely 3-linked graphs
• Primitive spatial graphs and graph minors
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS

Cited in

(12)

• Bipartite intrinsically knotted graphs with 23 edges
• A new intrinsically knotted graph with 22 edges
• The Y-triangle move does not preserve intrinsic knottedness
• Graphs on 21 edges that are not 2-apex
• A sufficient condition for intrinsic knotting of bipartite graphs
• Bipartite intrinsically knotted graphs with 22 edges
• An algorithm for detecting intrinsically knotted graphs
• Intrinsic knotting of almost complete partite graphs
• Two More Proofs that the Kinoshita Graph is Knotted
• Graphs of 20 edges are 2-apex, hence unknotted
• The smallest bipartite intrinsically knotted graph
• Exactly fourteen intrinsically knotted graphs have 21 edges

This page was built for publication: More intrinsically knotted graphs with 22 edges and the restoring method

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