Intrinsically n-linked Complete Bipartite Graphs

Details Intrinsically n-linked Complete Bipartite Graphs Intrinsically n-linked Complete Bipartite Graphs

2005-12-09

arxiv.org/abs/math/0512205v2

Mathematics

Geometric Topology

8 pages, LaTex; corrected proof and added thm and cor

Scientific paper

We prove that every embedding of $K_{2n+1,2n+1}$ into $\R^3$ contains a
non-split link of $n$-components. Further, given an embedding of
$K_{2n+1,2n+1}$ in $\R^3$, every edge of $K_{2n+1,2n+1}$ is contained in a
non-split $n$-component link in $K_{2n+1,2n+1}$.

Affiliated with

Also associated with

No associations

Rating

Intrinsically n-linked Complete Bipartite Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Intrinsically n-linked Complete Bipartite Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intrinsically n-linked Complete Bipartite Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-557230