Etude du graphe divisoriel 4

Abstract

We show that there is a permutation $f$ of the positive integers such that for $n\ge 2,$ l.c.m.$(f(n),f(n+1))\le cn(\log n{)}^2,$ where $c$ is a positive constant. It improves previous results of Erdös, Freud and Hegyvari (1983), and Chen and Ji (2011).

5 pages, in French