arXiv:2502.05930 [math.GT]AbstractReferencesReviewsResources
A short proof of generalized Conway--Gordon--Sachs theorem
Published 2025-02-09Version 1
The famous Conway--Gordon--Sachs theorem for the complete graph on six vertices was extended to the general complete graph on $n$ vertices by Kazakov--Korablev as a congruence modulo $2$, and its integral lift was given by Morishita--Nikkuni. However, the proof is complicated and long. In this paper, we provide a shorter proof of the generalized Conway--Gordon--Sachs theorem over integers.
Comments: 8 pages, 2 figures
Related articles: Most relevant | Search more
arXiv:math/0512513 [math.GT] (Published 2005-12-22)
A short proof of Bing's characterization of$S^3$
arXiv:2002.09349 [math.GT] (Published 2020-02-21)
A short proof of a conjecture of Aougab-Huang
arXiv:1904.06456 [math.GT] (Published 2019-04-13)
A short proof of the topological invariance of intersection homology