Intrinsic linking and knotting are arbitrarily complex

Erica Flapan, Blake Mellor, and Ramin Naimi. "Intrinsic linking and knotting are arbitrarily complex." Fundamenta Mathematicae 201.2 (2008): 131-148. <http://eudml.org/doc/283302>.

@article{EricaFlapan2008,
abstract = {We show that, given any n and α, any embedding of any sufficiently large complete graph in ℝ³ contains an oriented link with components Q₁, ..., Qₙ such that for every i ≠ j, $|lk(Q_i,Q_j)| ≥ α$ and $|a₂(Q_i)| ≥ α$, where $a₂(Q_i)$ denotes the second coefficient of the Conway polynomial of $Q_i$.},
author = {Erica Flapan, Blake Mellor, Ramin Naimi},
journal = {Fundamenta Mathematicae},
keywords = {intrinsically linked graphs; intrinsically knotted graphs},
language = {eng},
number = {2},
pages = {131-148},
title = {Intrinsic linking and knotting are arbitrarily complex},
url = {http://eudml.org/doc/283302},
volume = {201},
year = {2008},
}

TY - JOUR
AU - Erica Flapan
AU - Blake Mellor
AU - Ramin Naimi
TI - Intrinsic linking and knotting are arbitrarily complex
JO - Fundamenta Mathematicae
PY - 2008
VL - 201
IS - 2
SP - 131
EP - 148
AB - We show that, given any n and α, any embedding of any sufficiently large complete graph in ℝ³ contains an oriented link with components Q₁, ..., Qₙ such that for every i ≠ j, $|lk(Q_i,Q_j)| ≥ α$ and $|a₂(Q_i)| ≥ α$, where $a₂(Q_i)$ denotes the second coefficient of the Conway polynomial of $Q_i$.
LA - eng
KW - intrinsically linked graphs; intrinsically knotted graphs
UR - http://eudml.org/doc/283302
ER -