activity
20122023
most citedExactly fourteen intrinsically knotted graphs have 21 edges

2 citations · 3 across the 4 of their papers we have counts for

collaborators
Showing math.GTShow all

3 papers · 1 filter

math.GT2018

Stick number of spatial graphs

Minjung Lee, Sungjong No, Seungsang Oh

For a nontrivial knot , Negami found an upper bound on the stick number in terms of its crossing number which is . Later, Huh and Oh utilized the…

math.GT2014★ 1 cited

A new intrinsically knotted graph with 22 edges

Hyoungjun Kim, Hwa Jeong Lee, Minjung Lee +2

A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael showed that intrinsically knotted graphs have at leas…

math.GT2012★ 2 cited

Exactly fourteen intrinsically knotted graphs have 21 edges

Min Jung Lee, Hyoung Jun Kim, Hwa Jeong Lee +1

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 int…