Sur le graphe divisoriel
Acta Arithmetica (1995)
- Volume: 73, Issue: 2, page 189-198
- ISSN: 0065-1036
Access Full Article
top
How to cite
topPaul Erdős, and Eric Saias. "Sur le graphe divisoriel." Acta Arithmetica 73.2 (1995): 189-198. <http://eudml.org/doc/206816>.
@article{PaulErdős1995,
author = {Paul Erdős, Eric Saias},
journal = {Acta Arithmetica},
keywords = {divisor graph; relation in terms of least common multiple; chains for a relation; upper bound for the minimum number of chains},
language = {fre},
number = {2},
pages = {189-198},
title = {Sur le graphe divisoriel},
url = {http://eudml.org/doc/206816},
volume = {73},
year = {1995},
}
TY - JOUR
AU - Paul Erdős
AU - Eric Saias
TI - Sur le graphe divisoriel
JO - Acta Arithmetica
PY - 1995
VL - 73
IS - 2
SP - 189
EP - 198
LA - fre
KW - divisor graph; relation in terms of least common multiple; chains for a relation; upper bound for the minimum number of chains
UR - http://eudml.org/doc/206816
ER -
References
top- [1] P. Erdős, R. Freud and N. Hegyvári, Arithmetical properties of permutations of integers, Acta Math. Hungar. 41 (1983), 169-176. Zbl0518.10063
- [2] M. N. Huxley, The Distribution of Prime Numbers, Clarendon Press, Oxford, 1972. Zbl0248.10030
- [3] A. D. Pollington, There is a long path in the divisor graph, Ars. Combin. 16-B (1983), 303-304. Zbl0536.05041
- [4] C. Pomerance, On the longest simple path in the divisor graph, Congr. Numer. 40 (1983), 260-268.
- [5] E. Saias, Applications des entiers à diviseurs denses, prépublication.
- [6] G. Tenenbaum, Introduction à la théorie analytique et probabiliste des nombres, Inst. Élie Cartan 13, Université de Nancy I, 1990.
- [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.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.