Title of article
Linear Programming in Some Ramsey Problems
Author/Authors
Mckay، نويسنده , , B.D. and Radziszowski، نويسنده , , S.P.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1994
Pages
8
From page
125
To page
132
Abstract
We derive new upper bounds for the classical two-color Ramsey numbers R(4, 5) ≤ 27, R(5, 5) ≤ 52, and R(4, 6) ≤ 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 programs and with the help of other computer algorithms.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1994
Journal title
Journal of Combinatorial Theory Series B
Record number
1525884
Link To Document