𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds for multicolor classical Ramsey numbers

✍ Scribed by Wenlong Su; Haipeng Luo; Qiao Li

Book ID
105643707
Publisher
SP Science China Press
Year
1999
Tongue
English
Weight
343 KB
Volume
42
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

New lower bounds for seven classical Ram
New lower bounds for seven classical Ramsey numbers
✍ Kang Wu; Wenlong Su; Haipeng Luo; Xiaodong Xu πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 346 KB

New lower bounds for seven classical Ramsey numbers are obtained by considering some circulant graphs G n (A i ) with n β‰₯ 142 whose orders might be either prime or not. The results are

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 Lower Bounds on the Multicolor Ramse
New Lower Bounds on the Multicolor Ramsey Numbers rk(C4)
✍ Felix Lazebnik; Andrew J. Woldar πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 85 KB

The multicolor Ramsey number r k (C 4 ) is the smallest integer n for which any k-coloring of the edges of the complete graph K n must produce a monochromatic 4-cycle. It was proved earlier that r k (C 4 ) k 2 &k+2 for k&1 being a prime power. In this note we establish r k (C 4 ) k 2 +2 for k being