加载中…
Following a problem posed by Lov'asz in 1969, it is believed that every connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from groups having a -presentation, that is, for groups $G=\la a,b| a^2=1, b^s=1, (ab)^3=1, etc. \raabs\geq3ab$ has order 3. More precisely, it is shown that the Cayley graph has a Hamilton cycle when (and thus ) is congruent to 2 modulo 4, and has a long cycle missing only two vertices (and thus necessarily a Hamilton path) when is congruent to 0 modulo 4.

生成讲解博客的中文版本

生成AI智能校验的中文版本