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.
โฆ LIBER โฆ
Upper bounds for Ramsey numbers
โ Scribed by Lingsheng Shi
- Book ID
- 108315860
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 207 KB
- Volume
- 270
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
New Upper Bounds for Ramsey Numbers
โ
Y.R Huang; K.M Zhang
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 79 KB
Upper bounds for ramsey numbers R(3, 3,
โ
Wan, Honghui
๐
Article
๐
1997
๐
John Wiley and Sons
๐
English
โ 81 KB
๐ 2 views
In this paper we show that for n โฅ 4, R(3, 3, . . . , 3) < n!( e-e -1 + 3 2 ) + 1. Consequently, a new bound for Schur numbers is also given. Also, for even n โฅ 6, the Schur number S n is bounded by S n < n!( e-e -1 + 3 2 ) -n + 2.
Linear upper bounds for local Ramsey num
โ
Miroslaw Truszczynski; Zsolt Tuza
๐
Article
๐
1987
๐
Springer Japan
๐
English
โ 486 KB
An upper bound for ramsey numbers
โ
Yusheng Li; C.C Rousseau; Wenan Zang
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 138 KB
New Upper and Lower Bounds for Ramsey Nu
โ
Huang Yi Ru; Yang Jian Sheng
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 76 KB
An upper bound for some ramsey numbers
โ
Andrew Thomason
๐
Article
๐
1988
๐
John Wiley and Sons
๐
English
โ 307 KB
๐ 1 views
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