Physical Sciences and Mathematics Commons^™

Intrinsic Knotting And Linking Of Complete Graphs, Erica Flapan

Pomona Faculty Publications and Research

We show that for every m∈N, there exists an n∈N such that every embedding of the complete graph K_n in R³ contains a link of two components whose linking number is at least m. Furthermore, there exists an r∈N such that every embedding of K_r in R³ contains a knot Q with |a₂(Q)| ≥ m, where a₂(Q) denotes the second coefficient of the Conway polynomial of Q.