𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The value of the Ramsey number r(3, 8)

✍ Scribed by Brendan D. McKay; Zhang Ke Min

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
361 KB
Volume
16
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

The irredundant ramsey number s(3, 7)
The irredundant ramsey number s(3, 7)
✍ Guantao Chen; Cecil C. Rousseau πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 395 KB

## Abstract The irredundant Ramsey number __s__(__m, n__) is the smallest __p__ such that for every graph __G__ with __p__ vertices, either __G__ contains an __n__‐element irredundant set or its complement __G__ contains an __m__‐element irredundant set. Cockayne, Hattingh, and Mynhardt have given

The ramsey number of k5 - e
The ramsey number of k5 - e
✍ C. Clapham; G. Exoo; H. Harborth; I. Mengersen; J. Sheehan πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 428 KB
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

The ramsey number r(k1 + c4, k5 βˆ’ e)
The ramsey number r(k1 + c4, k5 βˆ’ e)
✍ Yang Yuansheng; G. R. T. Hendry πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 129 KB