Intrinsic linking and knotting are arbitrarily complex

Abstract: We show that, given any

n

and

a l p h a

, every embedding of any sufficiently large complete graph in

m a t h b b R^{3}

contains an oriented link with components

Q_{1}

, ...,

Q_{n}

such that for every

i o t = j

,

| l k (Q_{i}, Q_{j}) | g e q a l p h a

and

| a_{2} (Q_{i}) | g e q a l p h a

, where

a_{2} (Q_{i})

denotes the second coefficient of the Conway polynomial of

Q_{i}

.

Recommendations

Cited in

(12)

This page was built for publication: Intrinsic linking and knotting are arbitrarily complex