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 theor
etical motivation for searching for Ramsey graphs of prime order and p
rovide additional computational evidence that primes tend to be better
than composites.