Skip to main content
Article
Intrinsic linking and knotting are arbitrarily complex
Fundamenta Mathematicae
  • Erica Flapan
  • Blake Mellor, Loyola Marymount University
  • Ramin Naimi
Document Type
Article - post-print
Publication Date
1-1-2008
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.
Comments

This is a post-print version of the article.

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.