𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A result on C4-star Ramsey numbers

✍ Scribed by Guantao Chen

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
140 KB
Volume
163
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we will show that the Ramsey number r(C4,Ki,n+l)<~r(C4,Ki,n)+ 2 for all positive integers n. This result answers a question proposed by Burr, Erd6s, Faudree, Rousseau, and Schelp.

πŸ“œ SIMILAR VOLUMES

A ramsey-theoretic result involving chro
A ramsey-theoretic result involving chromatic numbers
✍ Stefan A. Burr πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 89 KB

## Abstract The following result is proved. A graph __G__ can be expressed as the edge‐disjoint union of __k__ graphs having chromatic numbers no greater than __m__~1~,…,__m__~__k__~, respectively, iff Ο‡(__G__) ≀ __m__~1~…__m__~__k__~.

On zero-sum Ramsey numbersβ€” stars
On zero-sum Ramsey numbersβ€” stars
✍ Yair Caro πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 347 KB

Caro, Y., On zero-sum Ramsey numbers--stars, Discrete Mathematics 104 (1992) l-6. Let n 3 k 2 2 be positive integers, k ( n. Let H, be the cyclic group of order k. Denote by R(K,,,> Z,) the minimal integer t such that for every &-coloring of the edges of K,, (i.e., a function c : E(K,)+ hk), there i

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

A note on Ramsey numbers
A note on Ramsey numbers
✍ MiklΓ³s Ajtai; JΓ‘nos KomlΓ³s; Endre SzemerΓ©di πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 310 KB