Some Ramsey-type results on intrinsic linking of n-complexes

Details Some Ramsey-type results on intrinsic linking of n-complexes Some Ramsey-type results on intrinsic linking of n-complexes

2011-12-20

arxiv.org/abs/1112.4558v2

Mathematics

Geometric Topology

26 pages, 4 figures. v2: added reference to arXiv:0705.2026 and updated abstract and introduction in view of that paper; impro

Scientific paper

Define the complete n-complex on N vertices to be the n-skeleton of an (N-1)-simplex. We show that embeddings of sufficiently large complete n-complexes in R^{2n+1} necessarily exhibit complicated linking behaviour, thereby extending known results on embeddings of large complete graphs in R^3 (the case n=1) to higher dimensions. In particular, we prove the existence of links of the following types: r-component links, with the linking pattern of a chain, necklace or keyring; 2-component links with linking number at least lambda in absolute value; and 2-component links with linking number a non-zero multiple of a given integer q. For fixed n the number of vertices required for each of our results grows at most polynomially with respect to the parameter r, lambda or q.

Affiliated with

Also associated with

No associations

Rating

Some Ramsey-type results on intrinsic linking of n-complexes 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 Some Ramsey-type results on intrinsic linking of n-complexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Ramsey-type results on intrinsic linking of n-complexes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-54565