加载中…
We study alternating Hamilton paths and cycles in the comparability graphs of finite posets. We prove that if a finite poset with at least two elements admits an alternating Hamilton path, then admits an alternating Hamilton cycle for every , where is the Boolean lattice. As a corollary, we settle a conjecture of Katona [Discrete Appl. Math., 2013]. Furthermore, we characterize the divisor lattices admitting alternating Hamilton paths and cycles.

生成讲解博客的中文版本

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