On the maximum number of integer colourings with forbidden monochromatic sums
Let f ( n , r ) denote the maximum number of colourings of A ⊆ { 1 , … , n } with r colours such that each colour class is sum-free. Here, a sum is a subset { x , y , z } such that x + y = z . We show that f ( n , 2 ) = 2 ⌈ n / 2 ⌉ , and describe the extremal subsets. Further, using linear...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Electronic Journal of Combinatorics
2021
|