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.
Linear upper bounds for local Ramsey numbers
β Scribed by Miroslaw Truszczynski; Zsolt Tuza
- Publisher
- Springer Japan
- Year
- 1987
- Tongue
- English
- Weight
- 486 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
We show that r(3, n) C(Z) -5 for n 2 13, and r(4, n)So(l') -1 for n 3 12.
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.