Intrinsic linking and knotting are arbitrarily complex

Erica Flapan, Blake Mellor, Ramin Naimi

We show that, given any $n$ and $\alpha$, every embedding of any sufficiently large complete graph in ${\mathbb{R}}^3$ contains an oriented link with components $Q_1$, ..., $Q_n$ such tha…