𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The multi-color Ramsey number of an odd cycle

✍ Scribed by Yusheng Li

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
73 KB
Volume
62
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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 from being regular. Β© 2009 Wiley Periodicals, Inc. J Graph Theory 62: 324–328, 2009

πŸ“œ SIMILAR VOLUMES

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 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

On the number of colorings of a snark mi
On the number of colorings of a snark minus an edge
✍ Richard C. Bradley πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 93 KB

For a given snark G and a given edge e of G, let (G; e) denote the nonnegative integer such that for a cubic graph conformal to G Γ€ feg, the number of Tait colorings with three given colors is 18 Á (G; e). If two snarks G 1 and G 2 are combined in certain well-known simple ways to form a snark G, th