## Abstract The __book with n pages__ __B__~__n__~ is the graph consisting of __n__ triangles sharing an edge. The __book Ramsey number__ __r__(__B__~__m__~,__B__~__n__~) is the smallest integer __r__ such that either __B__~__m__~ ⊂ __G__ or __B__~__n__~ ⊂ __G__ for every graph __G__ of order __r__
A note on Ramsey numbers
✍ Scribed by Miklós Ajtai; János Komlós; Endre Szemerédi
- Publisher
- Elsevier Science
- Year
- 1980
- Tongue
- English
- Weight
- 310 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Let __r(k__) denote the least integer __n__‐such that for any graph __G__ on __n__ vertices either __G__ or its complement G contains a complete graph __K__~k~ on __k__ vertices. in this paper, we prove the following lower bound for the Ramsey number __r(k__) by explicit construction: _
We show that r(3, n) C(Z) -5 for n 2 13, and r(4, n)So(l') -1 for n 3 12.
## for my mentors don bonar and gerald thompson We prove the following relation between regressive and classical Ramsey numbers ¼ 8; R 4 reg ð6Þ ¼ 15; and R 5 reg ð7Þ536: We prove that R 2 xþk ð4Þ42 kþ1 ð3 þ kÞ À ðk þ 1Þ; and use this to compute R 2 reg ð5Þ ¼ 15: Finally, we provide the bounds 19