In this note, we prove that the ⌈12nlog22n⌉th⌈21nlog22n⌉th power of a connected nn-vertex Eulerian digraph is Hamiltonian, and provide an infinite family of digraphs for which the ⌊n/2⌋th⌊n/2⌋th power is not.
生成讲解博客的中文版本
生成AI智能校验的中文版本