Linear Programming in Some Ramsey Proble
โ
B.D. Mckay; S.P. Radziszowski
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 332 KB
We derive new upper bounds for the classical two-color Ramsey numbers \(R(4,5) \leqslant 27, R(5,5) \leqslant 52\), and \(R(4,6) \leqslant 43\); the previous best upper bounds known for these numbers were 28,53 , and 44 , respectively. The new bounds are obtained by solving large integer linear prog