There is a family (H-k) of graphs such that H-k has order (1 + o(1))(r
oot 2/e)k2(k/2) but has no clique or stable set of order Ic. This resu
lt of Spencer provides the best known lower bound for the diagonal Ram
sey numbers R(k, k). Here we see that the graphs H-k can be taken to b
e regular, self-complementary, and pseudo-random. (C) 1996 Academic Pr
ess, Inc.