Exactly fourteen intrinsically knotted graphs have 21 edges
Algebraic and Geometric Topology, Tome 15 (2015) no. 6, pp. 3305-3322
Cet article a éte moissonné depuis la source Mathematical Sciences Publishers

Voir la notice de l'article

Johnson, Kidwell, and Michael showed that intrinsically knotted graphs have at least 21 edges. Also it is known that K7 and the thirteen graphs obtained from K7 by ∇Y moves are intrinsically knotted graphs with 21 edges. We prove that these 14 graphs are the only intrinsically knotted graphs with 21 edges.

DOI : 10.2140/agt.2015.15.3305
Classification : 57M25, 57M27
Keywords: intrinsically knotted, graph

Lee, Minjung  1   ; Kim, Hyoungjun  1   ; Lee, Hwa Jeong  2   ; Oh, Seungsang  1

1 Department of Mathematics, Korea University, Anam-dong, Sungbuk-ku, Seoul 136-701, South Korea
2 Department of Mathematical Sciences, KAIST, 291 Daehak-ro, Yuseong-gu, Daejeon 305-701, South Korea
@article{10_2140_agt_2015_15_3305,
     author = {Lee, Minjung and Kim, Hyoungjun and Lee, Hwa Jeong and Oh, Seungsang},
     title = {Exactly fourteen intrinsically knotted graphs have 21 edges},
     journal = {Algebraic and Geometric Topology},
     pages = {3305--3322},
     year = {2015},
     volume = {15},
     number = {6},
     doi = {10.2140/agt.2015.15.3305},
     url = {http://geodesic.mathdoc.fr/articles/10.2140/agt.2015.15.3305/}
}
TY  - JOUR
AU  - Lee, Minjung
AU  - Kim, Hyoungjun
AU  - Lee, Hwa Jeong
AU  - Oh, Seungsang
TI  - Exactly fourteen intrinsically knotted graphs have 21 edges
JO  - Algebraic and Geometric Topology
PY  - 2015
SP  - 3305
EP  - 3322
VL  - 15
IS  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.2140/agt.2015.15.3305/
DO  - 10.2140/agt.2015.15.3305
ID  - 10_2140_agt_2015_15_3305
ER  - 
%0 Journal Article
%A Lee, Minjung
%A Kim, Hyoungjun
%A Lee, Hwa Jeong
%A Oh, Seungsang
%T Exactly fourteen intrinsically knotted graphs have 21 edges
%J Algebraic and Geometric Topology
%D 2015
%P 3305-3322
%V 15
%N 6
%U http://geodesic.mathdoc.fr/articles/10.2140/agt.2015.15.3305/
%R 10.2140/agt.2015.15.3305
%F 10_2140_agt_2015_15_3305
Lee, Minjung; Kim, Hyoungjun; Lee, Hwa Jeong; Oh, Seungsang. Exactly fourteen intrinsically knotted graphs have 21 edges. Algebraic and Geometric Topology, Tome 15 (2015) no. 6, pp. 3305-3322. doi: 10.2140/agt.2015.15.3305

[1] P Blain, G Bowlin, T Fleming, J Foisy, J Hendricks, J Lacombe, Some results on intrinsically knotted graphs, J. Knot Theory Ramifications 16 (2007) 749

[2] J H Conway, C M Gordon, Knots and links in spatial graphs, J. Graph Theory 7 (1983) 445

[3] N Goldberg, T W Mattman, R Naimi, Many, many more intrinsically knotted graphs, Algebr. Geom. Topol. 14 (2014) 1801

[4] R Hanaki, R Nikkuni, K Taniyama, A Yamazaki, On intrinsically knotted or completely $3$–linked graphs, Pacific J. Math. 252 (2011) 407

[5] B Johnson, M E Kidwell, T S Michael, Intrinsically knotted graphs have at least $21$ edges, J. Knot Theory Ramifications 19 (2010) 1423

[6] T Kohara, S Suzuki, Some remarks on knots and links in spatial graphs, from: "Knots 90" (editor A Kawauchi), de Gruyter (1992) 435

[7] R Motwani, A Raghunathan, H Saran, Constructive results from graph minors: Linkless embeddings, from: "Proc. $29^{\mathrm{th}}$ annual symposium on foundations of computer science", IEEE (1988) 398

[8] M Ozawa, Y Tsutsumi, Primitive spatial graphs and graph minors, Rev. Mat. Complut. 20 (2007) 391

[9] N Robertson, P D Seymour, Graph minors, XX: Wagner's conjecture, J. Combin. Theory Ser. B 92 (2004) 325

Cité par Sources :