Answers are grounded in this paper and cite their sources.
The divisor graph is the non oriented graph whose vertices are the positive integers, two vertices being connected by an edge when the smallest one divides the largest one. We call chain of length ℓ any finite sequence of pairwise distinct positive integers a 1 ,a 2 ,...,a ℓ , such that, for 1≤i<ℓ, a i and a i+1 are connected by an edge in the divisor graph.
No takes yet. Share an insight, caveat, or question.
Éric Saïas (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: