Hamiltonicity of Cubic Cayley Graphs
Henry Glover, Dragan Marusic
Abstract
Following a problem posed by Lovász 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.
Create a lesson
Related papers
Off-Diagonal Induced Ramsey Numbers
Bruno Andrades, Marcelo Campos, Rafael Filipe et al.
Largest Sperner families with bounded VC-dimension
Gennian Ge, Hanyu Wang, Zixiang Xu et al.
Proof of two conjectures on the log-concavity of partition ranks and cranks
Jianxi Mao, Wenle Shi, Bao-Xuan Zhu
The Exact Number of Pentagons in Book-Free Graphs
Wentao Hu
A family of symmetric counterexamples to the bent sum decomposition conjecture
Máté Róbert Kepes, Anita Kercsó-Molnár, Viczián András
Counting graphs admitting a strictly matched involution
Stephan Dominique Andres, Igor Režan