Hostname: page-component-848d4c4894-5nwft Total loading time: 0 Render date: 2024-05-04T09:12:27.376Z Has data issue: false hasContentIssue false
  • English
  • Français

On Robillard′s Bounds for Ramsey Numbers

Published online by Cambridge University Press:  20 November 2018

J. G. Kalbfleisch
J. G. Kalbfleisch*
Affiliation:
University of Waterloo, Waterloo, Ontario
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A recent issue of the Bulletin contained a paper by Robillard [13] in which results from the theory of confounded factorial designs were used to obtain some lower bounds for Ramsey numbers. We shall derive, by more elementary methods, bounds which are much better than Robillard's in every example which he considered.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 14 , Issue 3 , September 1971 , pp. 437 - 440
Copyright
Copyright © Canadian Mathematical Society 1971

References

1. Erdös, P., Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292-294.Google Scholar
2. Erdös, P., Graph theory and probability II, Canad. J. Math. 13 (1961), 346-352.Google Scholar
3. Erdös, P. A., Hajnal, , and Rado, R., Partition relations for cardinal numbers, Acta. Math. Acad. Sci. Hungar. 16 (1965), 93-196.Google Scholar
4. Giraud, Guy, Sur les nombres de Ramsey ternaires-bicolores de la diagonale, C. R. Acad. Se. Paris, Sér. A, 268 (1969), 85-87.Google Scholar
5. Graver, J. E. and Yackel, J., Some graph theoretic results associated with Ramsey's theorem, J. Comb. Theory 4 (1968), 125-175.Google Scholar
6. Greenwood, R. E. and Gleason, A. M., Combinatorial relations and chromatic graphs, Canad. J. Math. 7 (1955), 1-7.Google Scholar
7. Isbell, John R., N(A, 4; 3)≥ 13, J. Comb. Theory 6 (1969), p. 210.Google Scholar
8. Kalbfleisch, J. G., Chromatic graphs and Ramsey's theorem, Ph.D. thesis, Univ. of Waterloo, 1966.Google Scholar
9. Kalbfleisch, J. G., On the Ramsey number N(4, 4; 3), Recent progress in combinatorics, (edited by W. T. Tutte), Academic Press, New York, 1969, 273-282.Google Scholar
10. Kéry, G., Ramsey egy gráfélmeleti tételéröl, Mat. Lapok 15 (1964), 202-224.Google Scholar
11. Krieger, Michael M., An inequality for higher Ramsey numbers, Notices Amer. Math. Soc. 15 (1968), p. 1035, Abstract No. 662–18.Google Scholar
12. Ramsey, F. P., On a problem in formal logic, Proc. London Math. Soc. (2) 30 (1930), 264-286.Google Scholar
13. Robillard, Pierre, Lower bounds for the Ramsey numbers, Canad. Math. Bull. 13 (1970), 227-229.Google Scholar
14. Walker, K., Dichromatic graphs and Ramsey numbers, J. Comb. Theory 5 (1968), 238-243.Google Scholar