Some new Ramsey colorings (Q1386552)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some new Ramsey colorings |
scientific article; zbMATH DE number 1155273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some new Ramsey colorings |
scientific article; zbMATH DE number 1155273 |
Statements
Some new Ramsey colorings (English)
0 references
25 May 1998
0 references
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\).
0 references
Ramsey colorings
0 references
Ramsey number
0 references
0.8658368587493896
0 references
0.8642963171005249
0 references
0.8550741672515869
0 references
