On path partitions of the divisor graph

Abstract

It is known that the longest simple path in the divisor graph that uses integers $\le 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)}$.