✦ LIBER ✦

The Ramsey Numbers of Large cycles Versus Odd Wheels

✍ Scribed by Surahmat; E. T. Baskoro; Ioan Tomescu

Publisher: Springer Japan
Year: 2008
Tongue: English
Weight: 87 KB
Volume: 24
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-007-0764-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The chromatic Ramsey number of odd wheel

The chromatic Ramsey number of odd wheels

✍ Nathalie Paul; Claude Tardif 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

We prove that the chromatic Ramsey number of every odd wheel W 2k+1 , k ≥ 2 is 14. That is, for every odd wheel W 2k+1 , there exists a 14-chromatic graph F such that when the edges of F are two-coloured, there is a monochromatic copy of W 2k+1 in F, and no graph F with chromatic number 13 has the s

3-colored Ramsey Numbers of Odd Cycles

✍ Annette Schelten; Ingo Schiermeyer; Ralph Faudree 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 69 KB

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

On Ramsey Numbers for Trees Versus Wheel

On Ramsey Numbers for Trees Versus Wheels of Five or Six Vertices

✍ E.T. Baskoro; Surahmat; S.M. Nababan; M. Miller 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 91 KB

On the Ramsey number of trees versus gra

On the Ramsey number of trees versus graphs with large clique number

✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 335 KB

Chvatal established that r(T,, K,,) = (m -1 ) ( n -1 ) + 1, where T, , , is an arbitrary tree of order m and K, is the complete graph of order n. This result was extended by Chartrand, Gould, and Polimeni who showed K, could be replaced by a graph with clique number n and order n + 5 provided n 2 3