We prove that ω 2(G n ) = 0 for any spatial complete graph G n with n ≥ 7 vertices, where ω 2 is the function introduced by J.Y. Conway and C. McA. Gordon in 1983.
Similar content being viewed by others
References
J. H. Conway and C. Gordon, “Knots and links in spatial graphs,” J. Graph Theory No. 7, 445–453 (1983).
A. Yu. Vesnin and A. V. Litvintseva, “On linking of Hamiltonian pairs of cycles in spatial graphs” [in Russian], Sib. Elektr. Mat. Izv. No. 7, 383–393 (2010).
P. Blain, G. Bowlin, J. Foisy, J. Hendricks, and J. LaCombe, “Knotted Hamiltonian cycles in spatial embeddings of complete graphs,” New York J. Math. 13, 11–16 (2007).
J. Foisy, “Corrigendum to “Knotted Hamiltonian cycles in spatial embeddings of complete graphs,” New York J. Math. 14, 285–287 (2008).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Vestnik Novosibirskogo Gosudarstvennogo Universiteta: Seriya Matematika, Mekhanika, Informatika 13, No. 2, 2013, pp. 51–60.
Rights and permissions
About this article
Cite this article
Kazakov, A.A., Korablev, P.G. Triviality of the Conway–Gordon Function ω 2 for Spatial Complete Graphs. J Math Sci 203, 490–498 (2014). https://doi.org/10.1007/s10958-014-2152-0
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-014-2152-0