An Integer Programming Approach to Compute Lower Bounds for Ramsey Numbers Using Circulant Graphs
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 clique of size $n$. Determining these numbers exactly is extremely hard, and even certifying a lower bound requires exhibiting an explicit colo...
Stefano Coniglio, Fabio Furini, I. Ljubić et al.
· 0 citations