𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some bounds for the Ramsey-Paris-Harrington numbers

✍ Scribed by Paul Erdös; George Mills

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
737 KB
Volume
30
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for some ramsey numbers
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

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.

Lower bounds for lower Ramsey numbers
Lower bounds for lower Ramsey numbers
✍ Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract For any graph __G__, let __i__(__G__) and μ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or

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.