On Cayley Digraphs That Do Not Have Hamiltonian Paths

Abstract EN

We construct an infinite family {Cay→(Gi;ai;bi)} of connected, 2-generated Cayley digraphs that do not have hamiltonian paths, such that the orders of the generators ai and bi are unbounded.

We also prove that if G is any finite group with |[G,G]|≤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).