P. Erdos, R.J. Faudree, C.C. Rousseau and R.H. Schelp [P. Erdos, R.J. Faudree, C.C. Rousseau, R.H. Schelp, The size Ramsey number, Period. Math. Hungar. 9 (1978) 145-161] studied the asymptotic behaviour of r@?(G,H) for certain graphs G,H. In this paper there will be given a lower bound for the diagonal size Ramsey number of K"n","n","n. The result is a generalization of a theorem for K"n","n given by P. Erdos and C.C. Rousseau [P. Erdos, C.C. Rousseau, The size Ramsey numbers of a complete bipartite graph, Discrete Math. 113 (1993) 259-262]. Moreover, an open question for bounds for size Ramsey number of each n-regular graph of order n+t for t>n-1 is posed.
['Halina Bielak']
Size Ramsey numbers for some regular graphs