On path partitions of the divisor graph

Paul Melotti, Eric Saias

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 minim…