arXiv · 1807.07783
On path partitions of the divisor graph
Abstract
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)}$.
Explore related subjects
Keep this discovery
Paul Melotti, Eric Saias. 2018-07-20. On path partitions of the divisor graph. https://arxiv.org/abs/1807.07783
Cite the original work for its findings. Save a collection to share your selection of sources.