Sum-free sets and Ramsey numbers
暂无分享,去创建一个
In this note we obtain new lower bounds for the Ramsey numbers R(5, 5) and R(5, 6). The method is based on computational results of partitioning the integers into sum-free sets. We obtain R(5, 5)@?42 and R(5, 6)@?53.
[1] J. G. Kalbfleisch. Construction of Special Edge-Chromatic Graphs , 1965, Canadian Mathematical Bulletin.
[2] H. L. Abbott,et al. A problem of Schur and its generalizations , 1972 .
[3] J. G. Kalbfleisch. Upper bounds for some Ramsey numbers , 1967 .