𝔖 Bobbio Scriptorium
✦   LIBER   ✦

3-colored Ramsey Numbers of Odd Cycles

✍ Scribed by Annette Schelten; Ingo Schiermeyer; Ralph Faudree

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
69 KB
Volume
3
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The multi-color Ramsey number of an odd
The multi-color Ramsey number of an odd cycle
✍ Yusheng Li 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 73 KB

## Abstract Let __r__~__k__~(__G__) be the __k__‐color Ramsey number of a graph __G__. It is shown that $r\_{k}(C\_{5})\le \sqrt{18^{k}\,k!}$ for __k__⩾2 and that __r__~__k__~(__C__~2__m__+ 1~)⩽(__c__^__k__^__k__!)^1/__m__^ if the Ramsey graphs of __r__~__k__~(__C__~2__m__+ 1~) are not far away fr

Multipartite Ramsey numbers for odd cycl
Multipartite Ramsey numbers for odd cycles
✍ András Gyárfás; Gábor N. Sárközy; Richard H. Schelp 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB

## Abstract In this paper we study multipartite Ramsey numbers for odd cycles. We formulate the following conjecture: Let __n__≥5 be an arbitrary positive odd integer; then, in any two‐coloring of the edges of the complete 5‐partite graph __K__((__n__−1)/2, (__n__−1)/2, (__n__−1)/2, (__n__−1)/2, 1)

On the multi-colored Ramsey numbers of c
On the multi-colored Ramsey numbers of cycles
✍ Tomasz Łuczak; Miklós Simonovits; Jozef Skokan 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB

For a graph L and an integer k ≥ 2, R k (L) denotes the smallest integer N for which for any edge-coloring of the complete graph K N by k colors there exists a color i for which the corresponding color class contains L as a subgraph.

The Ramsey numbers for cycles versus whe
The Ramsey numbers for cycles versus wheels of odd order
✍ Yaojun Chen; T.C. Edwin Cheng; Zhengke Miao; C.T. Ng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 267 KB

For two given graphs G 1 and G 2 , the Ramsey number R(G 1 , G 2 ) is the smallest integer n such that for any graph G of order n, either G contains G 1 or the complement of G contains G 2 . Let C n denote a cycle of order n and W m a wheel of order m + 1. It is conjectured by Surahmat, E.T. Baskoro

Bipartite anti-Ramsey numbers of cycles
Bipartite anti-Ramsey numbers of cycles
✍ Maria Axenovich; Tao Jiang; André Kündgen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

## Abstract We determine the maximum number of colors in a coloring of the edges of __K~m,n~__ such that every cycle of length 2__k__ contains at least two edges of the same color. One of our main tools is a result on generalized path covers in balanced bipartite graphs. For positive integers __q__