Open Access
2015 Exactly fourteen intrinsically knotted graphs have $21$ edges
Minjung Lee, Hyoungjun Kim, Hwa Jeong Lee, Seungsang Oh
Algebr. Geom. Topol. 15(6): 3305-3322 (2015). DOI: 10.2140/agt.2015.15.3305

Abstract

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.

Citation

Download Citation

Minjung Lee. Hyoungjun Kim. Hwa Jeong Lee. Seungsang Oh. "Exactly fourteen intrinsically knotted graphs have $21$ edges." Algebr. Geom. Topol. 15 (6) 3305 - 3322, 2015. https://doi.org/10.2140/agt.2015.15.3305

Information

Received: 9 June 2014; Revised: 13 March 2015; Accepted: 24 March 2015; Published: 2015
First available in Project Euclid: 16 November 2017

zbMATH: 1333.57015
MathSciNet: MR3450762
Digital Object Identifier: 10.2140/agt.2015.15.3305

Subjects:
Primary: 57M25 , 57M27

Keywords: graph , intrinsically knotted

Rights: Copyright © 2015 Mathematical Sciences Publishers

Vol.15 • No. 6 • 2015
MSP
Back to Top