  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 that for every $i\not =j$,
$|\lk(Q_i,Q_j)|\geq\alpha$ and $|a_2(Q_i)|\geq\alpha$, where $a_{2}(Q_i)$
denotes the second coefficient of the Conway polynomial of $Q_i$.
