加载中…
For a finite abelian group , define to be the minimum integer such that for every complete digraph on vertices and every map , there exists a directed cycle in such that . The study of was initiated by Alon and Krivelevich (2021). In this article, we prove that , where is prime, with an improved bound of when . These bounds are tight up to a factor which is polylogarithmic in .

生成讲解博客的中文版本

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