✦ LIBER ✦

The ramsey number of k5 - e

✍ Scribed by C. Clapham; G. Exoo; H. Harborth; I. Mengersen; J. Sheehan

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 428 KB
Volume: 13
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190130104

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The ramsey number r(k1 + c4, k5 − e)

✍ Yang Yuansheng; G. R. T. Hendry 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

An upper bound for the ramsey number r(K

An upper bound for the ramsey number r(K5 − e)

✍ H. Harborth; I. Mengersen 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

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 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 value of the Ramsey number r(3, 8)

✍ Brendan D. McKay; Zhang Ke Min 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 361 KB

## Abstract The Ramsey number __R__(3, 8) can be defined as the least number __n__ such that every graph on __n__ vertices contains either a triangle or an independent set of size 8. With the help of a substantial amount of computation, we prove that __R__(3, 8)=28.

Off-diagonal and asymptotic results on t

Off-diagonal and asymptotic results on the Ramsey number r(K2,m,K2,n)

✍ Roland Lortz; Ingrid Mengersen 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 1 views

## Abstract An upper bound on the Ramsey number __r__(__K__~2,__n‐s__~,__K__~2,__n__~) where __s__ ≥ 2 is presented. Considering certain __r__(__K__~2,__n‐s__~,__K__~2,__n__~)‐colorings obtained from strongly regular graphs, we additionally prove that this bound matches the exact value of __r__(__K