INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS
Danielle O’Donnol · Journal of Knot Theory and Its Ramifications · 2008
We prove that every embedding of K2n+1,2n+1 into ℝ3 contains a non-split link of n components. Further, given an embedding of K2n+1,2n+1 in ℝ3, every edge of K2n+1,2n+1 is contained in a non-split n-component link in K2n+1,2n+1.