Claims

../

1987_03_01_erdos_sarkozy: Erdős and Sárközy (Acta Math. Hungar. 1987): the largest subset of {1,...,N} with all pairwise sums squarefree has size between (log N)/248 and 3N^{3/4} log N for large N; refereed.

2002_08_01_gyarmati: Gyarmati (Period. Math. Hungar. 2001): a set of size >> log N in {1,...,N} with all pairwise sums squarefree, a second proof of Erdős and Sárközy's lower bound by graph theory; refereed.

2004_06_30_konyagin: Konyagin (Izv. Math. 2004): the largest subset of {1,...,N} with all pairwise sums squarefree has size at least c log^2 N log log N and at most N^{11/15} times a subexponential factor; refereed.

---