|
Organizers |
Intrinsically n-linked spatial graphs
by
Danielle O'Donnol
UCLA
Coauthors: G.C. Drummond-Cole (Stony Brook)
A graph G, is intrinsically linked if every embedding of G into R3 contains a nontrivial link. The study of intrinsically knotted and linked graphs is a recent area of knot theory. I will give a summary of the history of intrinsically linked graphs. A natural generalization of intrinsic linking is intrinsic n-linking. A graph G is intrinsically n-linked if every embedding of G into R3 contains a non-split n-component link. I will discuss some of my results about intrinsic n-linking in complete and complete bipartite graphs.
Date received: November 7, 2007
Copyright © 2007 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cavo-07.