加载中…
We prove that every connected Cayley digraph on a generalized dihedral group of order at least has a directed Hamilton cycle. In particular, this confirms a conjecture of Holszty'{n}ski and Strube from 1978 for dihedral groups. The key new ingredient is a three-fold sumset covering theorem for the terminal coordinates of Hamilton paths in cubic Haar graphs over abelian groups of odd order, with connection sets minimal subject to connectivity.

生成讲解博客的中文版本

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