Forbidden subgraphs in divisor graphs and an Erdős divisibility problem

Damek Davis

Erdős asked for the largest size $f(n)$ of a subset of $\{1,\dots ,n\}$ with no element dividing two others. We show that $f(n)=c_{2}n+o(n)$ for an effectively computable constant…