New upper bounds for the ramsey numbers r ( k , I ) are obtained. In particular it is shown there is a constant A such that The ramsey number r(k, l ) is the smallest integer n, such that any coloring with red and blue of the edges of the complete graph K , of order n yields either a red K , subgra
✦ LIBER ✦
A note on upper bounds for some Ramsey numbers
✍ Scribed by Chiê Nara; Shun-ichi Tachibana
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 345 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
We show that r(3, n) C(Z) -5 for n 2 13, and r(4, n)So(l') -1 for n 3 12.
📜 SIMILAR VOLUMES
An upper bound for some ramsey numbers
✍
Andrew Thomason
📂
Article
📅
1988
🏛
John Wiley and Sons
🌐
English
⚖ 307 KB
👁 1 views
New Upper Bounds for Ramsey Numbers
✍
Y.R Huang; K.M Zhang
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 79 KB
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.
Lower bounds for some Ramsey numbers
✍
H.L. Abbott
📂
Article
📅
1972
🏛
Elsevier Science
🌐
English
⚖ 385 KB
Lower bounds for some Ramsey numbers
✍
H.L Abbott; E.R Williams
📂
Article
📅
1974
🏛
Elsevier Science
🌐
English
⚖ 145 KB
New Upper and Lower Bounds for Ramsey Nu
✍
Huang Yi Ru; Yang Jian Sheng
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 76 KB
Some bounds for the Ramsey-Paris-Harring
✍
Paul Erdös; George Mills
📂
Article
📅
1981
🏛
Elsevier Science
🌐
English
⚖ 737 KB