An upper bound for the ramsey number M(5, 4)
- 31 July 1971
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 11 (1) , 1-10
- https://doi.org/10.1016/0097-3165(71)90002-1
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Dichromatic graphs and Ramsey numbersJournal of Combinatorial Theory, 1968
- Some graph theoretic results associated with Ramsey's theoremJournal of Combinatorial Theory, 1968
- Graph-Colouring and Combinatorial NumbersCanadian Journal of Mathematics, 1968
- Upper bounds for some Ramsey numbersJournal of Combinatorial Theory, 1967
- On Sets of Acquaintances and Strangers at any PartyThe American Mathematical Monthly, 1959
- Combinatorial Relations and Chromatic GraphsCanadian Journal of Mathematics, 1955