Irreducibility of spatial graphs

From MaRDI portal



Abstract: A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We show that irreducibility is preserved under certain deformations of embedded graphs. We show that certain embedded graphs are irreducible.


A \(2\)-sphere \(S\) embedded in \(S^3\) is called a separating sphere of a graph \(G\) if it is disjoint from \(G\) and each component of \(S^3-S\) has intersection with \(G.\) A graph \(G\) embedded in \(S^3\) is said to be non-splittable if there are no separating spheres of \(G.\) Then a graph \(G\) embedded in \(S^3\) is said to be irreducible if it is non-splittable and for any \(2\)-sphere \(S\) embedded in \(S^3\) that intersects \(G\) at one point the graph \(G\) is contained in one of the \(3\)-balls bounded by the \(2\)-sphere \(S.\) The theorem proved here states: Let \(G\) be a graph embedded in \(S^3\) and \(D\) a \(2\)-disk embedded in \(S^3\) such that \(\partial D \subset G\) and \(\text{int}(D)\) intersects \(G\) transversally in a finite number of points. Suppose that \(\text{int}(D) \cap G \not= \emptyset\) or \(\partial D \cap \text{ cl}(G-\partial D)\) is not a singleton. If the graph \(G'\) obtained from \(G\) by contracting \(D\) to a point is irreducible, then \(G\) is irreducible. As application of the theorem, the author shows that certain embedded graphs are irreducible.











This page was built for publication: Irreducibility of spatial graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4541080)