A Cameron and Erd\"os conjecture on counting primitive sets
Abstract
Let f(n) count the number of subsets of \1,...,n\ without an element dividing another. In this paper I show that f(n) grows like the n-th power of some real number, in the sense that n→ ∞f(n)1/n exists. This confirms a conjecture of Cameron and Erd\"os, proposed in a paper where they studied a number of similar problems, including the well known "Cameron-Erd\"os os Conjecture" on counting sum-free subsets.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.