Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-29T01:43:09.988Z Has data issue: false hasContentIssue false
  • English
  • Français

Lower Bounds for the Ramsey Numbers

Published online by Cambridge University Press:  20 November 2018

Pierre Robillard
Pierre Robillard*
Affiliation:
Département d' informatique Université de Montréal, Montréal, Québec
Rights & Permissions [Opens in a new window]

Abstract.

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 lower bound for a family of Ramsey numbers is derived using a geometrical argument.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 13 , Issue 2 , June 1970 , pp. 227 - 229
Copyright
Copyright © Canadian Mathematical Society 1970

References

1. Barlotti, A., Bounds for k-caps in PG{r, q) useful in the theory of error correcting codes, Inst, of Statist. Mimeo, 484.2 (1966).Google Scholar
2. Bose, R. C., Mathematical theory of the symmetrical factorial designt Sankhya 8 (1947), 107-166.Google Scholar
3. Bose, R. C., On some connections between the design of experiments and information theory, Bull. Inst. Internat. Statist. 38, part IV, (1961).Google Scholar
4. Bose, R. C. and Srivastava, J. N., On a bound useful in the theory of factorial designs and error correcting codes, Ann. Math. Statist. 35 (1964), 408-414.Google Scholar
5. Chakravarti, I. M., Bounds on error correcting codes {non random), Inst, of Statist. Mimeo, 451 (1965).Google Scholar
6. Gulati, B. J., Some useful bounds in symmetrical factorial designs {Abstract), Ann. Math. Statist. (2) 40, (1969).Google Scholar