No label defined (Q3976613)

[For the entire collection see Zbl 0734.00014.] The classical Ramsey number \(R(s,t)\) is the smallest integer \(n\) such that in any 2-coloring of the edges of \(K_ n\) there is a monochromatic \(K_ s\) in color 1 or else a monochromatic copy of \(K_ t\) in color 2. The author describes the computational experiments with the use of genetic algorithm and simulated annealing for producing Ramsey colorings of complete graphs. These heuristic methods are applied to improve lower bounds for several Ramsey numbers. In particular, he presents good 2- colorings of \(K_{48}\) and \(K_{52}\) thus showing that \(R(4,7)\geq 49\) and \(R(4,8)\geq 53\).