A Note on Sum-Free Sets of Integers

Men-Chang Hu
1980 Proceedings of the American Mathematical Society  
A set S of integers is said to be sum-free if a, b e S implies a + b $ S. Let g(n, k) denote the cardinality of a largest subset of {1, 2, . . ., n) that can be partitioned into k sum-free sets. In this note we show that g(n, 2) = n -[n/5]. Let D = {xr -x0: r = 1,..., 2q}. Clearly D E N and D has 2c; elements. Since
doi:10.2307/2043458 fatcat:h63cbqpb5bdr5mwfkbq7qkylk4