A short proof of the generalized Conway--Gordon--Sachs theorem
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.