Intrinsic Properties of Spatial Graphs - Denison University

Introduction Linking and Knotting Other Intrinsic Properties ConclusionComplex Linking and KnottingIn the last talk, you heard about what is known about whichgraphs are intrinsically knotted and linked.We can also ask how complicated these links and knots needto be. In 2002, Flapan proved:Theorem (Flapan, 2002)For every n, there is an m such that every embedding of K m inR 3 contains a link with |lk(J, K )| ≥ n and a knot with crossingnumber at least n.Blake MellorIntrinsic Properties of Spatial Graphs