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
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.