#### Volume 15, issue 6 (2015)

Exactly fourteen intrinsically knotted graphs have $21$ edges
 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 MR2341314 2 J H Conway, C M Gordon, Knots and links in spatial graphs, J. Graph Theory 7 (1983) 445 MR722061 3 N Goldberg, T W Mattman, R Naimi, Many, many more intrinsically knotted graphs, Algebr. Geom. Topol. 14 (2014) 1801 MR3212585 4 R Hanaki, R Nikkuni, K Taniyama, A Yamazaki, On intrinsically knotted or completely $3$–linked graphs, Pacific J. Math. 252 (2011) 407 MR2860431 5 B Johnson, M E Kidwell, T S Michael, Intrinsically knotted graphs have at least $21$ edges, J. Knot Theory Ramifications 19 (2010) 1423 MR2746195 6 T Kohara, S Suzuki, Some remarks on knots and links in spatial graphs, from: "Knots 90" (editor A Kawauchi), de Gruyter (1992) 435 MR1177440 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 MR2351115 9 N Robertson, P D Seymour, Graph minors, XX: Wagner's conjecture, J. Combin. Theory Ser. B 92 (2004) 325 MR2099147