Braid presentation of spatial graphs

2009/01/12 by Ken Kanno, Kanno, Ken, Kouki Taniyama +1
Mathematics · #57M15 #57M25 #FOS: Mathematics #Geometric Topology (math.GT) #math.GT #msc:57M15 #msc:57M25

paper · pdf · doi:10.48550/arxiv.0901.1511

13 pages, 15 figures

arxiv created 2009/01/12 · arxiv updated 2009/12/01

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.

Related

• Three-dimensional braids and their descriptions
• Diagrammatic representations of knots and links as closed braids
• Braids act on configurations of lines
• Spatial graph as connected sum of a planar graph and a braid
• Distinguishing surface-links with 4-charts with 2 crossings and 8 black vertices