Braid presentation of spatial graphs
Geometric Topology
2009-01-13 v1
Abstract
We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link it is known that the braid index is equal to the minimal number of Seifert circles. We show that an analogy does not hold for spatial graphs.
Keywords
Cite
@article{arxiv.0901.1511,
title = {Braid presentation of spatial graphs},
author = {Ken Kanno and Kouki Taniyama},
journal= {arXiv preprint arXiv:0901.1511},
year = {2009}
}
Comments
13 pages, 15 figures