Exactly fourteen intrinsically knotted graphs have 21 edges
classification
🧮 math.GT
keywords
graphsedgesintrinsicallyknottedexactlyfourteenjohnsonkidwell
read the original 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 rY moves are intrinsically knotted graphs with 21 edges. We prove that these 14 graphs are the only intrinsically knotted graphs with 21 edges.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.