R(4, 5) = 25
- 1 May 1995
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 19 (3) , 309-322
- https://doi.org/10.1002/jgt.3190190304
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
This publication has 7 references indexed in Scilit:
- Linear Programming in Some Ramsey ProblemsJournal of Combinatorial Theory, Series B, 1994
- The value of the Ramsey numberr(3, 8)Journal of Graph Theory, 1992
- An upper bound for the ramsey number M(5, 4)Journal of Combinatorial Theory, Series A, 1971
- Dichromatic graphs and Ramsey numbersJournal of Combinatorial Theory, 1968
- Construction of Special Edge-Chromatic GraphsCanadian Mathematical Bulletin, 1965
- Combinatorial Relations and Chromatic GraphsCanadian Journal of Mathematics, 1955
- On a Problem of Formal LogicProceedings of the London Mathematical Society, 1930