Counting subsets of integers free of arithmetic configurations

Patrick Morris, Miquel Ortega, Juanjo Rué

Cameron and Erdős asked if the number of sets free of arithmetic progressions of length $k$ is $2^{r_k(n)(1+o(1))}$, where $r_k(n)$ is the maximum cardinality of a $k$-AP-free subs…