Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGeneralization of the Conway-Gordon theorem and intrinsic linking on complete graphs
96
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic 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.
rate research
Read More
In 1983, 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 that for every spatial complete graph on seven vertices, the sum of the Arf invariants over all of the Hamiltonian knots is odd. In 2009, the second author gave integral lifts of the Conway-Gordon theorems in terms of the square of the linking number and the second coefficient of the Conway polynomial. In this paper, we generalize the integral Conway-Gordon theorems to complete graphs with arbitrary number of vertices greater than or equal to six. As an application, we show that for every rectilinear spatial complete graph whose number of vertices is greater than or equal to six, the sum of the second coefficients of the Conway polynomials over all of the Hamiltonian knots is determined explicitly in terms of the number of triangle-triangle Hopf links.
We give a Conway-Gordon type formula for invariants of knots and links in a spatial complete four-partite graph $K_{3,3,1,1}$ in terms of the square of the linking number and the second coefficient of the Conway polynomial. As an application, we show that every rectilinear spatial $K_{3,3,1,1}$ contains a nontrivial Hamiltonian knot.
For every spatial embedding of each graph in the Petersen family, it is known that the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2. In this paper, we give an integral lift of this formula in terms of the square of the linking number and the second coefficient of the Conway polynomial.
Conway-Gordon proved that for every spatial complete graph on 6 vertices, the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2, and for every spatial complete graph on 7 vertices, the sum of the Arf invariants over all of the Hamiltonian knots is also congruent to 1 modulo 2. In this paper, we give a Conway-Gordon type theorem for any graph which is obtained from the complete graph on 6 or 7 vertices by a finite sequence of $triangle Y$-exchanges.
A low-dimensional version of our main result is the following `converse of the Conway-Gordon-Sachs Theorem on intrinsic linking of the graph $K_6$ in 3-space: For any integer $z$ there are 6 points $1,2,3,4,5,6$ in 3-space, of which every two $i,j$ are joint by a polygonal line $ij$, the interior of one polygonal line is disjoint with any other polygonal line, the linking coefficient of any pair disjoint 3-cycles except for ${123,456}$ is zero, and for the exceptional pair ${123,456}$ is $2z+1$. We prove a higher-dimensional analogue, which is a `converse of a lemma by Segal-Spie.z.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
