Some new Ramsey colorings
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\).
scientific article; zbMATH DE number 1155273