Intrinsic linking and knotting are arbitrarily complex
Erica Flapan, Blake Mellor, Ramin Naimi (2008)
Fundamenta Mathematicae
Similarity:
We show that, given any n and α, any embedding of any sufficiently large complete graph in ℝ³ contains an oriented link with components Q₁, ..., Qₙ such that for every i ≠ j, and , where denotes the second coefficient of the Conway polynomial of .