Bridge position and the representativity of spatial graphs
Makoto Ozawa

TL;DR
This paper extends Otal's result to trivial spatial graphs, introduces the bridge string number and representativity invariants for spatial graphs, and establishes a bound relating these invariants, generalizing classical knot theory results.
Contribution
It generalizes Otal's theorem to spatial graphs, introduces new invariants for spatial graphs, and proves a bound connecting these invariants, extending classical knot theory results.
Findings
Proved the existence of a sphere containing the graph intersecting the bridge sphere in a single loop.
Defined the bridge string number as a minimal intersection measure for spatial graphs.
Established that the representativity is at most half the bridge string number for non-trivial spatial graphs.
Abstract
First, we extend Otal's result for the trivial knot to trivial spatial graphs, namely, we show that for any bridge tangle decomposing sphere for a trivial spatial graph , there exists a 2-sphere such that contains and intersects in a single loop. Next, we introduce two invariants for spatial graphs. As a generalization of the bridge number for knots, we define the {\em bridge string number} of a spatial graph as the minimal number of for all bridge tangle decomposing sphere . As a spatial version of the representativity for a graph embedded in a surface, we define the {\em representativity} of a non-trivial spatial graph as \[ r(\Gamma)=\max_{F\in\mathcal{F}} \min_{D\in\mathcal{D}_F} |\partial D\cap \Gamma|, \] where is the set of all closed surfaces containing and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Computational Geometry and Mesh Generation · Topological and Geometric Data Analysis
