On Cayley digraphs that do not have Hamiltonian paths (Q2248717)

Summary: We construct an infinite family \(\{\overrightarrow{\mathrm{Cay}}(G_1;a_i;b_i)\}\) of connected, 2-generated Cayley digraphs that do not have Hamiltonian paths, such that the orders of the generators \(a_i\) and \(b_i\) are unbounded. We also prove that if \(G\) is any finite group with \(||G,G||\leq 3\), then every connected Cayley digraph on \(G\) has a Hamiltonian path (but the conclusion does not always hold when \(||G,G||=4\) or 5).