|
Organizers |
Site-specific Gordian distances of spatial graphs
by
Kouki Taniyama
Waseda University
For two spatial embeddings of an abstract graph we define site-specific Gordian distance between them. It is defined to be the minimal number of crossing changes between two specified abstract edges. We determine site-specific Gordian distances between some pairs of spatial embeddings of some abstract graphs. It has an application to puzzle ring problem. The site-specific Gordian distance between a Milnor link and a trivial link is determined. We use covering space arguments for the proofs.
Date received: December 3, 2014
Copyright © 2014 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 # cbjz-32.