arXiv 0907.01522009-07math.GT

A refinement of the Conway-Gordon theorems

Ryo Nikkuni

备注：: 17 pages, 10 figures
发表信息：: Topology Appl. 156 (2009), 2782--2794
DOI：: 10.1016/j.topol.2009.08.013

英文摘要：

In 1983, Conway-Gordon showed 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 article, we give integral lifts of the Conway-Gordon theorems above in terms of the square of the linking number and the second coefficient of the Conway polynomial. As applications, we give alternative topological proofs of theorems of Brown-Ramirez Alfonsin and Huh-Jeon for rectilinear spatial complete graphs which were proved by computational and combinatorial methods.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Conway-Gordon type theorem for the complete four-partite graph $K_{3,3,1,1}$

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.

2014-05-08math.GT

$\triangle Y$-exchanges and the Conway-Gordon theorems

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.

2011-09-23math.GT

Generalizations of the Conway-Gordon theorems and intrinsic knotting on complete graphs

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 vertice…

2018-12-24math.GT

On Conway-Gordon type theorems for graphs in the Petersen family

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.

2013-07-11math.GT

广义Conway--Gordon--Sachs定理的一个简短证明

A short proof of the generalized Conway--Gordon--Sachs theorem

本文针对广义Conway--Gordon--Sachs定理，在整数环上给出了一个比现有证明更简短的证明，该定理将六顶点完全图的情形推广到任意n个顶点的完全图。

2025-06-21math.COmath.GT

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

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 determin…

2021-04-08math.GT

更多相关论文收起更多论文

Alternative proofs of the Conway-Gordon-Sachs Theorems

In this paper we present new proofs of the Conway-Gordon-Sachs and Sachs Theorems on the linked cycles in graphs embedded in $\R^3$. We reduce these theorems to certain property of graphs mapped to the plane.

2014-04-12math.ATmath.COmath.GT

On van Kampen-Flores, Conway-Gordon-Sachs and Radon theorems

We exhibit relations between van Kampen-Flores, Conway-Gordon-Sachs and Radon theorems, by presenting direct proofs of some implications between them. The key idea is an interesting relation between the van Kampen and the Conway-Gordon-Sachs numbers for restrictions of a map of $(d+2)$-simplex to $\mathbb R^d$ to the $(d+1)$-face and to the $[d/2]$-skeleton.

2022-01-17cs.CGmath.ATmath.GT

广义 Conway–Gordon 型同余的逆命题

Converses to generalized Conway--Gordon type congruences

针对空间完全图的 Conway–Gordon 型同余，本文证明其逆命题：所有满足该同余的整数均可由某个空间完全图实现。

2023-12-11math.COmath.GT

Algebraic proofs of linear versions of the Conway--Gordon--Sachs theorem and the van Kampen--Flores theorem

In this paper we present short algebraic proofs of the Linear Conway--Gordon--Sachs and the Linear van Kampen--Flores theorems in the spirit of the Radon theorem on convex hulls. {\bf Theorem.} {\it Take any $n+3$ general position points in $\mathbb{R}^n$. If $n$ is odd, then there are two linked $(n+1)/2$-simplices with the vertices at these points. If $n$ is even, then one can choose two disjoint $(n+2)/2$-tuples such that the interiors $(n/2)$-simplices with the vertices at these $(n+2)/2$-tuples intersect each other.} This theorem is interesting even in case of small dimensions.

2015-08-13math.COmath.GTmath.MG

Quantum Relatives of Alexander Polynomial

The multivariable Conway function is generalized to oriented framed trivalent graphs equipped with additional structure (coloring). This is done via refinements of Reshetikhin-Turaev functors based on irreducible representations of quantized gl(1|1) and sl(2). The corresponding face state sum models for the generalized Conway function are presented.

2002-04-24math.GTmath.QA

空间图的不变量关联

Linking invariants of spatial graphs

Moscow Institute of Physics and Technology（莫斯科物理技术学院）；Physical and Mathematical School №146 (Perm)（第146号物理数学学校（彼尔姆））；Independent University of Moscow（莫斯科独立大学）

该研究回顾空间图的环绕数与Wu–Simon数定义，揭示Conway–Gordon–Sachs定理的逆命题，提出其向多重环绕推广的猜想，论述基于平面图表，无需空间几何知识。

2026-08-18cs.CGmath.COmath.GT

A proof using Böhme's Lemma that no Petersen family graph has a flat embedding

Sachs and Conway-Gordon used linking number and a beautiful counting argument to prove that every graph in the Petersen family is intrinsically linked (have a pair of disjoint cycles that form a nonsplit link in every spatial embedding) and thus each family member has no flat spatial embedding (an embedding for which every cycle bounds a disk with interior disjoint from the graph). We give an alternate proof that every Petersen family graph has no flat embedding by applying Böhme's Lemma and the Jordan-Brouwer Separation Theorem.

2023-02-24math.COmath.GT