The independence and clique cover numbers of the squarefree graph

We determine the largest subset $A\subseteq \{1,\dots ,n\}$ such that for all $a,b\in A$, the product $ab$ is not squarefree. Specifically, the maximum size is achieved by the complement of the odd squarefree numbers. This resolves a problem of Paul Erdős and András Sárközy from 1992.