English

Hamiltonicity of Cubic Cayley Graphs

Combinatorics 2007-05-23 v1 Group Theory

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)(2,s,3)-presentation, that is, for groups G=\laa,ba2=1,bs=1,(ab)3=1,etc.\raG=\la a,b| a^2=1, b^s=1, (ab)^3=1, etc. \ra generated by an involution aa and an element bb of order s3s\geq3 such that their product abab has order 3. More precisely, it is shown that the Cayley graph X=Cay(G,{a,b,b1})X=Cay(G,\{a,b,b^{-1}\}) has a Hamilton cycle when G|G| (and thus ss) is congruent to 2 modulo 4, and has a long cycle missing only two vertices (and thus necessarily a Hamilton path) when G|G| is congruent to 0 modulo 4.

Keywords

Cite

@article{arxiv.math/0508647,
  title  = {Hamiltonicity of Cubic Cayley Graphs},
  author = {Henry Glover and Dragan Marusic},
  journal= {arXiv preprint arXiv:math/0508647},
  year   = {2007}
}

Comments

13 pages, 6 figures

R2 v1 2026-07-22T17:23:58.428Z