Abstract.
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Reçu le 20 juin 2000; en forme révisée le 4 Avril 2002
Rights and permissions
About this article
Cite this article
Saias, E. Etude du graphe divisoriel 2. Monatsh Math 137, 301–312 (2002). https://doi.org/10.1007/s00605-002-0502-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00605-002-0502-3