New Ramsey Bounds from Cyclic Graphs of Prime Order
Neil J. Calkin, Paul L. Erdos, Craig A. Tovey · SIAM Journal on Discrete Mathematics · 1997
We present new explicit lower bounds for some Ramsey numbers. All the graphs are cyclic and are on a prime number of vertices. We give theoretical motivation for searching for Ramsey graphs of prime order and provide additional computational evidence that primes tend to be better than composites.