Abstract
AbstractGiven a set of positive integers, an old question in additive combinatorics asks that whether contains a sum‐free subset of size at least for some increasing unbounded function . The question is generally attacked in the literature by considering another conjecture, which asserts that as , . This conjecture, if true, would also imply that a similar phenomenon occurs for ‐sum‐free sets for every . In this note, we prove the latter result directly. The new ingredient of our proof is a structural analysis on the host set , which might be of independent interest.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
