On Large Sum-Free Sets: Revised Bounds and Patterns
In this paper, we rectify two previous results found in the literature. Our work leads to a new upper bound for the largest sum-free subset of [1,n] with the lowest value in n3,n2, and the identification of all patterns that can be used to form sum-free sets of maximum cardinality.
Authors
- Renato Cordeiro de Amorim (ORCID: https://orcid.org/0000-0002-6805-4609)
Institutions
- University of Essex (GB)
Publication Details
- Journal
- Mathematics
- Published
- 2024-12-10
- DOI
- https://doi.org/10.3390/math12243889
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00