Hamiltonicity after reversing the directed edges at a vertex of a Cartesian product
Abstract
Let Cm and Cn be directed cycles of length m and n, with m,n 3, and let P( Cm Cn) be the digraph that is obtained from the Cartesian product Cm Cn by choosing a vertex v, and reversing the orientation of all four directed edges that are incident with v. (This operation is called "pushing" at the vertex v.) By applying a special case of unpublished work of S.X.Wu, we find elementary number-theoretic necessary and sufficient conditions for the existence of a hamiltonian cycle in P( Cm Cn). A consequence is that if P( Cm Cn) is hamiltonian, then (m,n) = 1, which implies that Cm Cn is not hamiltonian. This final conclusion verifies a conjecture of J.B.Klerlein and E.C.Carr.
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.