New lower bounds for seven classical Ramsey numbers are obtained by considering some circulant graphs G n (A i ) with n β₯ 142 whose orders might be either prime or not. The results are
A survey of bounds for classical Ramsey numbers
β Scribed by F. R. K. Chung; C. M. Grinstead
- Publisher
- John Wiley and Sons
- Year
- 1983
- Tongue
- English
- Weight
- 546 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
This paper is a survey of the methods used for determining exact values and bounds for the classical Ramsey numbers in the case that the sets being colored are twoβelement sets. Results concerning the asymptotic behavior of the Ramsey functions R(k,l) and R~m~(k) are also given.
π SIMILAR VOLUMES
## Abstract For any graph __G__, let __i__(__G__) and ΞΌ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or
The Ramsey number R(G 1 , G 2 ) is the smallest integer p such that for any graph Some new upper bound formulas are obtained for R(G 1 , G 2 ) and R(m, n), and we derive some new upper bounds for Ramsey numbers here.