Intrinsic linking and knotting are arbitrarily complex
From MaRDI portal
Publication:3530834
DOI10.4064/fm201-2-3zbMath1170.57001arXivmath/0610501OpenAlexW2016514117MaRDI QIDQ3530834
Erica Flapan, Blake Mellor, Ramin Naimi
Publication date: 20 October 2008
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610501
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Intrinsic linking and knotting are arbitrarily complex in directed graphs ⋮ Intrinsically knotted and 4-linked directed graphs ⋮ Linearly free graphs ⋮ Some Ramsey-type results on intrinsic linking of \(n\)-complexes ⋮ Counting links and knots in complete graphs ⋮ Counting links in complete graphs ⋮ Intrinsic linking and knotting in tournaments ⋮ Intrinsic linking with linking numbers of specified divisibility ⋮ Every graph has an embedding in 𝑆³ containing no non-hyperbolic knot
This page was built for publication: Intrinsic linking and knotting are arbitrarily complex