TY - JOUR
T1 - More intrinsically knotted graphs with 22 edges and the restoring method
AU - Kim, Hyoungjun
AU - Mattman, Thomas
AU - Oh, Seungsang
N1 - Funding Information:
The first author was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Korea government Ministry of Education (2009-0093827) and Ministry of Science and ICT (NRF-2018R1C1B6006692).
Funding Information:
Seungsang Oh was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No. NRF-2017R1A2B2007216).
Publisher Copyright:
© 2018 World Scientific Publishing Company.
PY - 2018/9/1
Y1 - 2018/9/1
N2 - 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 K7 and the 13 graphs obtained from K7 by ΔY 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 K3,3,1,1 family, Cousins 97 and 99 of the E9 + e family and two others that were previously unknown.
AB - 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 K7 and the 13 graphs obtained from K7 by ΔY 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 K3,3,1,1 family, Cousins 97 and 99 of the E9 + e family and two others that were previously unknown.
KW - Graph embedding
KW - intrinsically knotted
UR - http://www.scopus.com/inward/record.url?scp=85052914810&partnerID=8YFLogxK
U2 - 10.1142/S0218216518500591
DO - 10.1142/S0218216518500591
M3 - Article
AN - SCOPUS:85052914810
SN - 0218-2165
VL - 27
JO - Journal of Knot Theory and its Ramifications
JF - Journal of Knot Theory and its Ramifications
IS - 10
M1 - 1850059
ER -