AbstractWe show that for everyk⩾3 the number of subsets of {1, 2, …, n} containing no solution tox1+x2+…+xk=y, where thexineed not be distinct, is at mostc2αn, whereα=(k−1)/k
AbstractA subset of the natural numbers isk-sum-free if it contains no solutions of the equationx1+…...
AbstractA finite set of distinct integers is called an r-set if it contains at least r elements not ...
Cameron and Erdős [6] asked whether the number of maximal sum-free sets in { 1 , . . . , n } is much...
We show that for every k greater or equal than 3 the number of subsets of {1,2,...,n} containing no...
AbstractWe show that the number of subsets of {1,2,…,n} with no solution tox1+x2+…+xk=y1+y2+…+ylfork...
We show that for every k ≥ 3 the number of subsets of {1, 2,..., n} containing no solution to x1 + x...
AbstractWe show that for everyk⩾3 the number of subsets of {1, 2, …, n} containing no solution tox1+...
AbstractWe show that the number of subsets of {1,2,…,n} with no solution tox1+x2+…+xk=y1+y2+…+ylfork...
Cameron and Erdös have considered the question: how many sum-free sets are contained in the first n...
Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whethe...
AbstractA subset of the natural numbers isk-sum-free if it contains no solutions of the equationx1+…...
AbstractThe largest possible number of representations of an integer in thek-fold sumsetkA=A+…+Ais m...
AbstractLet {a1,a2,a3,…} be an unbounded sequence of positive integers with an+1/an approaching α as...
AbstractIn this paper we develop a method for determining the number of integers without large prime...
Abstract. We show that the number of subsets of {1, 2,..., n} with no solution to x1+x2+...+xk = y1+...
AbstractA subset of the natural numbers isk-sum-free if it contains no solutions of the equationx1+…...
AbstractA finite set of distinct integers is called an r-set if it contains at least r elements not ...
Cameron and Erdős [6] asked whether the number of maximal sum-free sets in { 1 , . . . , n } is much...
We show that for every k greater or equal than 3 the number of subsets of {1,2,...,n} containing no...
AbstractWe show that the number of subsets of {1,2,…,n} with no solution tox1+x2+…+xk=y1+y2+…+ylfork...
We show that for every k ≥ 3 the number of subsets of {1, 2,..., n} containing no solution to x1 + x...
AbstractWe show that for everyk⩾3 the number of subsets of {1, 2, …, n} containing no solution tox1+...
AbstractWe show that the number of subsets of {1,2,…,n} with no solution tox1+x2+…+xk=y1+y2+…+ylfork...
Cameron and Erdös have considered the question: how many sum-free sets are contained in the first n...
Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whethe...
AbstractA subset of the natural numbers isk-sum-free if it contains no solutions of the equationx1+…...
AbstractThe largest possible number of representations of an integer in thek-fold sumsetkA=A+…+Ais m...
AbstractLet {a1,a2,a3,…} be an unbounded sequence of positive integers with an+1/an approaching α as...
AbstractIn this paper we develop a method for determining the number of integers without large prime...
Abstract. We show that the number of subsets of {1, 2,..., n} with no solution to x1+x2+...+xk = y1+...
AbstractA subset of the natural numbers isk-sum-free if it contains no solutions of the equationx1+…...
AbstractA finite set of distinct integers is called an r-set if it contains at least r elements not ...
Cameron and Erdős [6] asked whether the number of maximal sum-free sets in { 1 , . . . , n } is much...
DOI
Add to ORKG