Etude du graphe divisoriel 2

 We show that the maximum number of positive integers that appear in k non disjoint paths of the divisorial graph restricted to the numbers ⩽N, is about N log k/log N. We study also some other related questions. Re?u le 20 juin 2000; en forme révisée le 4 Avril 2002