𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotic Upper Bounds for Ramsey Functions

✍ Scribed by Yusheng Li; Cecil C. Rousseau; Wenan Zang

Publisher
Springer Japan
Year
2001
Tongue
English
Weight
90 KB
Volume
17
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

An upper bound for ramsey numbers
An upper bound for ramsey numbers
✍ Yusheng Li; C.C Rousseau; Wenan Zang πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 138 KB
Asymptotic bounds for irredundant and mi
Asymptotic bounds for irredundant and mixed Ramsey numbers
✍ Guantao Chen; Johannes H. Hattingh; Cecil C. Rousseau πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 473 KB πŸ‘ 1 views

## Abstract The irredundant Ramsey number __s(m, n)__ is the smallest __N__ such that in every red‐blue coloring of the edges of __K__~__N__~, either the blue graph contains an __m__‐element irredundant set or the red graph contains an __n__‐element irredundant set. The definition of the mixed Rams