Hamiltonicity of Cubic Cayley Graphs

Abstract

Following a problem posed by Lov\'asz in 1969, it is believed that every connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from groups having a (2,s,3)-presentation, that is, for groups G= a,b| a2=1, bs=1, (ab)3=1, etc. generated by an involution a and an element b of order s≥3 such that their product ab has order 3. More precisely, it is shown that the Cayley graph X=Cay(G,\a,b,b-1\) has a Hamilton cycle when |G| (and thus s) is congruent to 2 modulo 4, and has a long cycle missing only two vertices (and thus necessarily a Hamilton path) when |G| is congruent to 0 modulo 4.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…