in this note we obtain new tower bounds for the Ramsey numbers R(5,S) and R(5,6). The methrld is based on computational results of partitioning the integers into sum-free sets. WC obtain R(S, 5) > 42 and R(5,6) 2 53.
Sum-free sets and ramsey numbers II
โ Scribed by D. Hanson; J. Hanson
- Book ID
- 107748241
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 151 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A subset of the natural numbers is k-sum-free if it contains no solutions of the equation x 1 + } } } +x k = y, and strongly k-sum-free when it is l-sum-free for every l=2, ..., k. It is shown that every k-sum-free set with upper density larger than 1ร(k+1) is a subset of a periodic k-sum-free set a
A counting argument is developed and divisibility properties of the binomial coefficients are combined to prove, among other results, that where K n , resp. K k n , is the complete, resp. complete k-uniform, hypergaph and R(K n , Z p ), R(K k n , Z 2 ) are the corresponding zero-sum Ramsey numbers.