Intrinsic linking and knotting are arbitrarily complex

الأصل · EN

We show that, given any n and α, every embedding of any sufficiently large complete graph in R³ contains an oriented link with components Q₁,..., Qₙ such that for every i =j, |(Qᵢ,Qⱼ)|≥α and |a₂(Qᵢ)|≥α, where a₂(Qᵢ) denotes the second coefficient of the Conway polynomial of Qᵢ.