On SAT Solvers and Ramsey-type Numbers

Burcu Canakci, Hannah Christenson, Robert Fleischman +3

We created and parallelized two SAT solvers to find new bounds on some Ramsey-type numbers. For $c>0$, let $R_c(L)$ be the least $n$ such that for all $c$-colorings of the $[n]\t…