An Integer Programming Approach to Compute Lower Bounds for Ramsey Numbers Using Circulant Graphs

Stefano Coniglio, Fabio Furini, Ivana Ljubić +3

The Ramsey number $R(m,n)$ is the smallest order at which every red-blue edge coloring of a complete graph must contain a blue clique (a complete subgraph) of size $m$ or a red cli…