@article{bwmeta1.element.bwnjournal-article-aav73i2p189bwm,
author = {Paul Erd\H os and Eric Saias},
title = {Sur le graphe divisoriel},
journal = {Acta Arithmetica},
volume = {69},
year = {1995},
pages = {189-198},
language = {fr},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-aav73i2p189bwm}
}
Paul Erdős; Eric Saias. Sur le graphe divisoriel. Acta Arithmetica, Tome 69 (1995) pp. 189-198. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-aav73i2p189bwm/
[000] [1] P. Erdős, R. Freud and N. Hegyvári, Arithmetical properties of permutations of integers, Acta Math. Hungar. 41 (1983), 169-176. | Zbl 0518.10063
[001] [2] M. N. Huxley, The Distribution of Prime Numbers, Clarendon Press, Oxford, 1972. | Zbl 0248.10030
[002] [3] A. D. Pollington, There is a long path in the divisor graph, Ars. Combin. 16-B (1983), 303-304. | Zbl 0536.05041
[003] [4] C. Pomerance, On the longest simple path in the divisor graph, Congr. Numer. 40 (1983), 260-268.
[004] [5] E. Saias, Applications des entiers à diviseurs denses, prépublication.
[005] [6] G. Tenenbaum, Introduction à la théorie analytique et probabiliste des nombres, Inst. Élie Cartan 13, Université de Nancy I, 1990.
[006] [7] G. Tenenbaum, Sur un problème de crible et ses applications, 2. Corrigendum et étude de graphe divisoriel, Ann. Sci. École Norm. Sup. (4) 28 (1995), 115-127.