Voir la notice de l'article provenant de la source Cambridge University Press
Robillard, Pierre. Lower Bounds for the Ramsey Numbers. Canadian mathematical bulletin, Tome 13 (1970) no. 2, pp. 227-229. doi: 10.4153/CMB-1970-046-0
@article{10_4153_CMB_1970_046_0,
author = {Robillard, Pierre},
title = {Lower {Bounds} for the {Ramsey} {Numbers}},
journal = {Canadian mathematical bulletin},
pages = {227--229},
year = {1970},
volume = {13},
number = {2},
doi = {10.4153/CMB-1970-046-0},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1970-046-0/}
}
[1] 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] 2. Bose, R. C., Mathematical theory of the symmetrical factorial designt Sankhya 8 (1947), 107-166. Google Scholar
[3] 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] 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] 5. Chakravarti, I. M., Bounds on error correcting codes {non random), Inst, of Statist. Mimeo, 451 (1965). Google Scholar
[6] 6. Gulati, B. J., Some useful bounds in symmetrical factorial designs {Abstract), Ann. Math. Statist. (2) 40, (1969). Google Scholar
Cité par Sources :