
arXiv: math/0508647
Following a problem posed by Lovász in 1969, it is believed that every finite connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from finite groups having a (2,s,3) -presentation, that is, for groups G=\langle a,b\mid a^2=1, b^s=1, (ab)^3=1, \dots \rangle generated by an involution a and an element b of order s\geq3 such that their product ab has order 3 . More precisely, it is shown that the Cayley graph X=\operatorname{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 adjacent vertices (and thus necessarily a Hamilton path) when |G| is congruent to 0 modulo 4 .
FOS: Mathematics, Mathematics - Combinatorics, 05C25, 20B25, Combinatorics (math.CO), Group Theory (math.GR), Mathematics - Group Theory
FOS: Mathematics, Mathematics - Combinatorics, 05C25, 20B25, Combinatorics (math.CO), Group Theory (math.GR), Mathematics - Group Theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 29 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
