A Cameron and Erd\"os conjecture on counting primitive sets

zbMath1441.11040arXiv1711.08107MaRDI QIDQ5384235

Rodrigo Angelo

Publication date: 21 June 2019

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

zbMATH Keywords

primitive setssumfree subsets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Inverse problems of additive number theory, including sumsets (11P70)

Related Items (4)

The number of maximum primitive sets of integers ⋮ The order dimension of divisibility ⋮ The counting version of a problem of Erdős ⋮ Counting primitive subsets and other statistics of the divisor graph of \(\{1,2,\dots,n\}\)

This page was built for publication: A Cameron and Erd\"os conjecture on counting primitive sets