𝔖 Bobbio Scriptorium
✦   LIBER   ✦

NOTE New Upper Bounds for a Canonical Ramsey Problem

✍ Scribed by Tao Jiang; Dhruv Mubayi

Publisher
Springer-Verlag
Year
2000
Tongue
English
Weight
150 KB
Volume
20
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new upper bound for the bipartite Rams
A new upper bound for the bipartite Ramsey problem
✍ David Conlon πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 89 KB πŸ‘ 1 views

## Abstract We consider the following question: how large does __n__ have to be to guarantee that in any two‐coloring of the edges of the complete graph __K__~__n,n__~ there is a monochromatic __K__~__k,k__~? In the late 1970s, Irving showed that it was sufficient, for __k__ large, that __n__ β‰₯ 2^_

New Upper Bounds for Ramsey Numbers
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.

A note on upper bounds for some Ramsey n
A note on upper bounds for some Ramsey numbers
✍ ChiΓͺ Nara; Shun-ichi Tachibana πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 345 KB

We show that r(3, n) C(Z) -5 for n 2 13, and r(4, n)So(l') -1 for n 3 12.