The structure of maximum subsets of {1, ... , n} with no solutions to a+b=kc

Sammanfattning

If k is a positive integer, we say that a set A of positive integers is k-sum-free if there do not exist a, b, c in A such that a + b = kc. In particular we give a precise characterization of the structure of maximum sized k-sum-free sets in {1,..., n} for k >= 4 and n large.

Publicerad i

Electronic Journal of Combinatorics
2005, volym: 12, nummer: 1, artikelnummer: R19
Utgivare: ELECTRONIC JOURNAL OF COMBINATORICS

SLU författare

• Knape, Jonas

  • Chalmers Tekniska Högskola

UKÄ forskningsämne

Algebra och logik

Permanent länk till denna sida (URI)

https://res.slu.se/id/publ/102485