Hamiltonian cycles in Cayley graphs whose order has few prime factors release_jbsxb36rnfgd7o2jyuw26oypmi

by K.Kutnar, D.Marusic, D.W.Morris, J.Morris, P.Sparl

Released as a article .



We prove that if Cay(G;S) is a connected Cayley graph with n vertices, and the prime factorization of n is very small, then Cay(G;S) has a hamiltonian cycle. More precisely, if p, q, and r are distinct primes, then n can be of the form kp with k < 32 and k not equal to 24, or of the form kpq with k < 6, or of the form pqr, or of the form kp^2 with k < 5, or of the form kp^3 with k < 3.
In text/plain format

Archived Files and Locations

application/pdf  565.3 kB
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2011-02-15
Version   v2
Language   en ?
arXiv  1009.5795v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: ec95b549-c105-471d-8372-3661aac1a3ca