arXiv · math/0205231
Intrinsic knotting and linking of complete graphs
Abstract
We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every embedding of K_r in R^3 contains a knot Q with |a_2(Q)| > m-1, where a_2(Q) denotes the second coefficient of the Conway polynomial of Q.
Explore related subjects
Keep this discovery
Erica Flapan. 2002-05-22. Intrinsic knotting and linking of complete graphs. https://doi.org/10.2140/agt.2002.2.371
Cite the original work for its findings. Save a collection to share your selection of sources.