Probability in Computer Science · Probabilistic Method: Sum-Free Sets (Optional)

Lesson 3

Nikolai Chukhin · Alexander S. Kulikov

For the curious 🤓
Actually, the constant \(\frac{1}{3}\) is tight. [Eberhard, Green, Manners, 2014] showed that there is a set of size \(n\) with no sum-free subset of size \(\tfrac{1}{3}n + o(n)\).