关于divisor图的路划分
On path partitions of the divisor graph
摘要:
已知使用整数$\leq N$的除数图中的最长简单路径的长度为$\asymp N/\log N$。研究了将$\{1,2,\dots, N\}$划分为因子图的最小路数的问题,证明了在这样的划分中,最长路的长度渐近地为$N^{1-o(1)}$ .
英文摘要:
It is known that the longest simple path in the divisor graph that uses integers $\leq N$ is of length $\asymp N/\log N$. We study the partitions of $\{1,2,\dots, N\}$ into a minimal number of paths of the divisor graph, and we show that in such a partition, the longest path can have length asymptotically $N^{1-o(1)}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。