Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T02:11:15.937Z Has data issue: false hasContentIssue false

On Robillard′s Bounds for Ramsey Numbers

Published online by Cambridge University Press:  20 November 2018

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1971