![](https://d3ilqtpdwi981i.cloudfront.net/pzzZWPmDJRwpY-Y5gGSgqFmB-uA=/425x550/smart/https://bepress-attached-resources.s3.amazonaws.com/uploads/d0/c9/56/d0c95652-2cab-47bd-887a-efca62245146/thumbnail_318ff060-eeb2-4d59-b9fd-8d5d8053b367.jpg)
Article
Intrinsic linking and knotting are arbitrarily complex
Fundamenta Mathematicae
Document Type
Article - post-print
Publication Date
1-1-2008
Disciplines
Abstract
We show that, given any n and α, every embedding of any sufficiently large complete graph in R3 contains an oriented link with components Q1, ..., Qn such that for every i≠j, $|\lk(Q_i,Q_j)|\geq\alpha$ and |a2(Qi)|≥α, where a2(Qi) denotes the second coefficient of the Conway polynomial of Qi.
Citation Information
Flapan, E., B. Mellor, and R. Naimi, 2008: Intrinsic linking and knotting are arbitrarily complex. Fundamenta Mathematicae, 201.2, 131-148, arXiv:math/0610501.
This is a post-print version of the article.