Counting primitive subsets and other statistics of the divisor graph of \(\{1,2,\dots,n\}\)

DOI10.1016/j.ejc.2020.103237zbMath1473.11059arXiv1808.04923OpenAlexW3086510694MaRDI QIDQ2225441

Nathan McNew

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.04923

zbMATH Keywords

asymptoticscombinatorial number theorypath coversdivisor graphprimitive subsetsprogression-free subsets

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Other combinatorial number theory (11B75)

Related Items (4)

Permutations and the divisor graph of [1,n] ⋮ The number of multiplicative Sidon sets of integers ⋮ Coprime permutations ⋮ Unnamed Item

Uses Software

• SageMath
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sharp transitions in making squares
• Multiplicative structures in additively large sets
• On path partitions of the divisor graph
• Hamiltonian coverings of some graphs
• Study of the divisor graph. III
• Integers with a large friable component
• Sur le graphe divisoriel
• On path partitions of the divisor graph
• A Cameron and Erd\"os conjecture on counting primitive sets
• On sequences without geometric progressions
• On sets of integers which contain no three terms in geometric progression
• Sets of integers containing no n terms in geometric progression

This page was built for publication: Counting primitive subsets and other statistics of the divisor graph of \(\{1,2,\dots,n\}\)