Abstract
Cameron and Erdős have considered the question: how many sum-free sets are contained in the first n integers;they have shown (personal communication) that the number of sum-free sets contained within the integers {⅓n, ⅓n + 1, …, n} is c.2n/2. We prove that the number of sets contained within {l, 2, …,n} is o(2n(½+ε)) for every ε > 0.
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.
