Ramsey Number Counterexample Checking and One Vertex Extension Linearly Bound by $s$ and $t$

Adam M. Lehavi

The Ramsey number $R(s,t)$ is the smallest integer $n$ such that all graphs of size $n$ contain a clique of size $s$ or an independent set of size $t$. $\mathcal{R}(s,t,n)$ is the…