RamseyRL: A Framework for Intelligent Ramsey Number Counterexample Searching

Steve Vott, Adam M. Lehavi

The Ramsey number is the minimum number of nodes, $n=R(s,t)$, such that all undirected simple graphs of order $n$, contain a clique of order $s$, or an independent set of order…