|
Organizers |
Minor Minimal Intrinsically 3-linked Graphs
by
Danielle O'Donnol
UCLA
A graph G, is intrinsically linked if every embedding of G into R3 contains a non-split 2-component link. The study of intrinsically knotted and linked graphs is a recent area of knot theory. A natural generalization of intrinsic linking is intrinsic n-linking. A graph G, is intrinsically n-linked if every embedding of G in R3 contains a non-split n-component link. I will discuss some of my results about minor minimal intrinsically 3-linked graphs.
Date received: March 28, 2008
Copyright © 2008 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 # cawt-21.