Applying Tabu Search to Determine New Ramsey Graphs

Konrad Piwakowski

Abstract


In this note an adaptation of heuristic tabu search algorithm for finding Ramsey graphs is presented. As a result, seven new lower bounds for classical Ramsey numbers are established: $R(3,13)\geq 59$, $R(4,10)\geq 80$, $R(4,11)\geq 96$, $R(4,12)\geq 106$, $R(4,13)\geq 118$, $R(4,14)\geq 129$, and $R(5,8)\geq 95$.


Full Text: PDF