Study of the divisor graph. IV

DOI10.5802/AFST.1652MaRDI QIDQ2214733zbMATH OpenOpenAlexFDO

Authors Éric Saïas, P-A Mazet

Publication date 10 December 2020

Published in Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5802/afst.1652

zbMATH Keywords

chain-permutationdivisor graph of positive integersleast commnon multiple

Mathematics Subject Classification ID

Paths and cycles (05C38) Infinite graphs (05C63) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Other combinatorial number theory (11B75)

Recommendations

• Arithmetical properties of permutations of integers
• The permutation of integers with small least common multiple of two subsequent terms
• Sur un problème de crible et ses applications. II. Corrigendum et étude du graphe divisoriel
• Sur le graphe divisoriel
• Study of the divisor graph. III

Cites work

• Applications des entiers à diviseurs denses
• Arithmetical properties of permutations of integers
• Integers with dense divisors. I
• Practical numbers and the distribution of divisors
• Sur un problème de crible et ses applications
• Sur un problème de crible et ses applications. II. Corrigendum et étude du graphe divisoriel
• The permutation of integers with small least common multiple of two subsequent terms

Cited in

(8)

• Study of the divisor graph. II
• Study of the divisor graph. III
• Sur un problème de crible et ses applications. II. Corrigendum et étude du graphe divisoriel
• Sur le graphe divisoriel
• Permutations and the divisor graph of [1,n]
• The permutation of integers with small least common multiple of two subsequent terms
• Study of the divisor graph 5
• Permutations with arithmetic constraints

This page was built for publication: Study of the divisor graph. IV

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2214733)