|
|||||
|
|
R(4, 5) = 25 |
|
| Authors: | Brendan D McKay Stanislaw P Radziszowski |
| Abstract: | The Ramsey number R(4, 5) is defined to be the least positive integer n such that every n-vertex graph contains either a clique of order 4 or an independent set of order 5. With the help of a long computation using novel techniques, we prove that R(4, 5) = 25. © 1995 John Wiley & Sons, Inc. |
| Keywords: | |