Some new Ramsey colorings
type: Item
instance of: scholarly article
title: Some new Ramsey colorings
zbMATH Open document ID: 0896.05043
author: Geoffrey Exoo
published in: The Electronic Journal of Combinatorics
publication date: 1998-05-25T00:00:00Z
full work available at URL: https://eudml.org/doc/119558
full work available at URL: v5i1r29.html
review text: The author presents an algorithm for generating Ramsey colorings of complete graphs. Using a computer implementation, several new lower bounds for classical Ramsey number have been found: \(\text{R}(3,12)> 51\); \(\text{R}(4,8)> 54\); \(\text{R}(5, 9)> 115\); \(\text{R}(6, 7)> 108\); \(\text{R}(6, 8)>121\); \(\text{R}(6, 9)> 152\); \(\text{R}(6, 10)> 166\); \(\text{R}(3, 4,5)> 79\); \(\text{R}(3, 3, 3,4)> 86\).
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05D10
zbMATH DE Number: 1155273
zbMATH Keywords: Ramsey colorings
zbMATH Keywords: Ramsey number
reviewed by: Jack E. Graver
MaRDI profile type: MaRDI publication profile
Recommended article: Q4489494
Recommended article: On the Ramsey number \(R(4,6)\)
Recommended article: New lower bounds of eigth classical multicolor Ramsey numbers
Recommended article: New lower bounds for 28 classical Ramsey numbers
Recommended article: Q3976613
description: scientific article; zbMATH DE number 1155273