A characterization of knots in a spatial graph

DOI10.1142/S0218216500000645MaRDI QIDQ2706865zbMATH OpenOpenAlexFDO

Authors Kazuko Onda

Publication date 12 December 2002

Published in Journal of Knot Theory and its Ramifications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218216500000645

zbMATH Keywords

adaptableConway polynomialknotrealizable

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Review text

For a graph \(G\), let \(\Gamma\) be the set of cycles of \(G\). Suppose that for each \(\gamma \in \Gamma\), an embedding \(\varphi_{\gamma} \to S^3\) is given. A set \(\{ \varphi_{\gamma} \mid \gamma \in \Gamma \}\) is said to be realizable if there is an embedding \(f : G \to S^3\) such that the restriction \(f|_{\gamma}\) is ambient isotopic to \(\varphi_{\gamma}\) for any \(\gamma \in \Gamma\). A graph \(G\) is said to be adaptable if any set \(\{ \varphi_{\gamma} \mid \gamma \in \Gamma \}\) is realizable. NEWLINENEWLINENEWLINEAny non-planar graph is not adaptable [\textit{T. Motohashi} and \textit{K. Taniyama}, Knots '96, World Scientific. 185-200 (1997; Zbl 0960.57003)] and the set of non-adaptable graphs all of which proper minors are adaptable contains exactly two non-planar graphs, \(K_5\) and \(K_{33}\), [the reviewer, ibid., 115-121(1997; Zbl 0960.57004)] and at least eight planar graphs [\textit{K. Taniyama} and the reviewer, Topology Appl. 112, No. 1, 87-109 (2001; Zbl 0968.57001)]. For seven graphs of the eight planar graphs, the author gives a necessary and sufficient condition for \(\{ \varphi_{\gamma} \mid \gamma \in \Gamma\}\) to be realizable in terms of the second coefficient of the Conway polynomial. The necessary condition was essentially given in [Taniyama and the reviewer, loc. cit.].

Recommendations

• Realization of knots and links in a spatial graph
• Minimally knotted embeddings of planar graphs
• Delta-unknotting operation and adaptability of certain graphs
• Vassiliev invariants of knots in a spatial graph.
• scientific article; zbMATH DE number 1160692

Cites work

• Claspers and finite type invariants of links
• Cobordism, homotopy and homology of graphs in \(\mathbb{R}^ 3\)

Cited in

(13)

• Detecting unknotted graphs in 3-space
• Clasp-pass moves on knots, links and spatial graphs
• Knots and links in certain spatial complete graphs
• Knots and links in spatial graphs: a survey
• Delta-unknotting operation and adaptability of certain graphs
• UNKNOTTING SINGULAR CHARTS WITH NO BLACK VERTICES BY REDUCING NODE-PAIRS
• Spatial graphs with local knots
• scientific article; zbMATH DE number 1160692 (Why is no real title available?)
• A CHARACTERIZATION OF KNOTS IN A SPATIAL GRAPH II
• Spatial graph as connected sum of a planar graph and a braid
• Realization of knots and links in a spatial graph
• Vassiliev invariants of knots in a spatial graph.
• Knotted Hamiltonian cycles in spatial embeddings of complete graphs

This page was built for publication: A characterization of knots in a spatial graph

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