Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs

DOI10.1007/S00026-021-00536-5MaRDI QIDQ2033480zbMATH OpenOpenAlexFDO

Authors Hiroko Morishita, Ryo Nikkuni

Publication date 17 June 2021

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2004.10013

zbMATH Keywords

Conway-Gordon theoremslinking numberspatial graphs

Mathematics Subject Classification ID

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

Abstract: Conway and Gordon proved that for every spatial complete graph on six vertices, the sum of the linking numbers over all of the constituent two-component links is odd, and Kazakov and Korablev proved that for every spatial complete graph with arbitrary number of vertices greater than six, the sum of the linking numbers over all of the constituent two-component Hamiltonian links is even. In this paper, we show that for every spatial complete graph whose number of vertices is greater than six, the sum of the square of the linking numbers over all of the two-component Hamiltonian links is determined explicitly in terms of the sum over all of the triangle-triangle constituent links. As an application, we show that if the number of vertices is sufficiently large then every spatial complete graph contains a two-component Hamiltonian link whose absolute value of the linking number is arbitrary large. Some applications to rectilinear spatial complete graphs are also given.

Review text

This paper proves a theorem about two-component links that contain all vertices of an embedding of complete graphs: It is shown that for every spatial complete graph whose number of vertices is greater than six, the sum of the square of the linking numbers over all of the two-component Hamiltonian links (i.e. links containing all vertices) is determined explicitly in terms of the sum over all of the triangle-triangle constituent links. Corollaries for graphs with large number of vertices are proven and consequences for rectilinear (i.e. piecewise linear) embeddings of complete graphs are presented.

Recommendations

• Generalizations of the Conway-Gordon theorems and intrinsic knotting on complete graphs
• A refinement of the Conway-Gordon theorems
• Intrinsic knotting and linking of complete graphs
• ON THE SIZE OF LINKS IN K_{n, n}, K_{n, n, 1}, AND K_n
• A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT

Cites work

• A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT
• A refinement of the Conway-Gordon theorems
• Conway-Gordon type theorem for the complete four-partite graph \(K_{3,3,1,1}\)
• Counting links and knots in complete graphs
• Counting links in complete graphs
• Generalizations of the Conway-Gordon theorems and intrinsic knotting on complete graphs
• Intrinsic knotting and linking of complete graphs
• Knots and links in certain spatial complete graphs
• KNOTS AND LINKS IN LINEAR EMBEDDINGS OF K₆
• Knots and links in spatial graphs
• KNOTTED HAMILTONIAN CYCLES IN LINEAR EMBEDDING OF K₇ INTO ℝ³
• Linear embeddings of \(K_{9}\) are triple linked
• Linking number and writhe in random linear embeddings of graphs
• Notes on spatial representations of graphs
• On linking of Hamiltonian pairs of cycles in spatial graphs
• On the number of links in a linearly embedded K_3,3,1
• Recent developments in spatial graph theory
• Spatial graphs and oriented matroids: The trefoil
• Stick number of non-paneled knotless spatial graphs

Cited in

(9)

• Generalizations of the Conway-Gordon theorems and intrinsic knotting on complete graphs
• Conway-Gordon problem for reduced complete spatial graphs
• Y-exchanges and the Conway-Gordon theorems
• A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT
• Capturing links in spatial complete graphs
• Triviality of the function _2 for spatial imbeddings of complete graphs
• Some `converses' to intrinsic linking theorems
• A short proof of the generalized Conway-Gordon-Sachs theorem
• On linking of Hamiltonian pairs of cycles in spatial graphs

This page was built for publication: Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs

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