Claims

../

2000_12_28_luczak_schoen: For all large n the number of maximal sum-free subsets of the first n integers is at most 2^(n/2 - n/2^28), which is o(2^(n/2)); the first answer to the displayed question, refereed in the Proc. AMS; not held.

2009_04_09_wolfovitz: At most 2^(3n/8 + o(n)), which is o(2^(n/2)), maximal sum-free subsets of the first n integers; Wolfovitz's bound, refereed in the European Journal of Combinatorics, quoted from Balogh--Liu--Sharifzadeh--Treglown; not held.

2014_09_19_balogh_liu_sharifzadeh_treglown: The number of maximal sum-free subsets of the first n integers is 2^((1/4 + o(1)) n), matching the Cameron--Erdős lower bound in the exponent; Theorem 1.1 of Balogh, Liu, Sharifzadeh and Treglown, refereed (Proc. AMS).

2015_02_26_balogh_liu_sharifzadeh_treglown: For each residue i of n modulo 4 there is a constant C_i with the number of maximal sum-free subsets of the first n integers equal to (C_i + o(1)) 2^(n/4); Theorem 1.1 of Balogh, Liu, Sharifzadeh and Treglown, in the JEMS.

---