Hamiltonian paths in Cayley digraphs of finitely-generated infinite Abelian groups (Q914702): Difference between revisions

If G is a group and S is a generating set for G (with \(1\not\in S)\) then Cay(G:S) denotes the directed Cayley graph with vertex set G and edge set \(\{\) (g,gs): \(g\in G\); \(s\in S\}\). The main result is Theorem 5.1: let a and b be relatively prime positive integers, let T be a finite Abelian group, and let S generate T. Then the directed Cayley graph (Cay(\(\{\) a,- b\(\}\) : \({\mathbb{Z}}))^ n\times Cay(S:T)\) has a 2-way Hamiltonian path; it has a 1-way Hamiltonian path if and only if \(n>1.\) This result represents a step toward proving an analog for directed graphs of a result by \textit{C. St.-J. A. Nash-Williams} [Math. Proc. Camb. Philos. Soc. 55, 232-238 (1959; Zbl 0089.184)] that every undirected Cayley graph of a finitely generated infinite Abelian group has a 2-way Hamiltonian path and, except for groups of the form \({\mathbb{Z}}\times T\), also has a 1-way Hamiltonian path. The author also obtains some results concerning pairs of edge-disjoint Hamiltonian paths in G.