๐”– Bobbio Scriptorium
โœฆ   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

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.

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.

An upper bound for ramsey numbers
โœ Yusheng Li; C.C Rousseau; Wenan Zang ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 138 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