Claims

../

1973_06_01_choi: Choi's 1973 lower bound (Proc. Amer. Math. Soc. 39) for the largest sum-free subsequence of n numbers, a constant times n^{1/2} beyond Erdős's (n/2)^{1/2}; refereed, known here through its zbMATH review.

1975_01_01_choi_komlos_szemeredi: The 1975 theorem that l(n) lies between (n log n / log log n)^{1/2} and n / log n up to constants, which answers the first displayed question of Problem 790 affirmatively; refereed and credited by the site.

2026_09_13_korsky: AI-assisted full claim that every set of n integers has a sum-free subset of at least c n / (log n)^2 elements, proving l(n) ≥ n^{1-o(1)} and answering the second displayed question in the negative; a file-sharing write-up.

---