Realization of knots and links in a spatial graph (Q5930695)

For a graph \(G\), let \(\Gamma\) be either the set \(\Gamma_1\) of cycles of \(G\) or the set \(\Gamma_2\) of pairs of disjoint cycles of \(G\). Suppose that for each \(\gamma \in \Gamma\), an embedding \(\phi_{\gamma} \to S^3\) is given. A set \(\{ \phi_{\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 \(\phi_{\gamma}\) for any \(\gamma \in \Gamma\). A graph \(G\) is said to be adaptable if any set \(\{ \phi_{\gamma} \mid \gamma \in \Gamma_1 \}\) is realizable. The authors present conditions when knots and links are realizable in special classes of graphs. If \(G\) is the complete graph \(K_5\) or the complete bipartite graph \(K_{3,3}\), then the authors give a necessary and sufficient condition for \(\{ \phi_{\gamma} \mid \gamma \in \Gamma_1 \}\) to be realizable in terms of the second coefficient of the Conway polynomial. If \(G\) is one of the seven Petersen graphs, then the authors give a necessary and sufficient condition for \(\{ \phi_{\gamma} \mid \gamma \in \Gamma_2 \}\) to be realizable in terms of the linking number. Also, the authors show that the set of non-adaptable graphs all proper minors of which being adaptable contains eight specified planar graphs.