The size Ramsey number of a complete bipartite graph (Q2366025)

The size Ramsey number \(\hat r(G,H)\) of graphs \(G\) and \(H\) is the smallest integer \(\hat r\) so that there is a graph \(F\) with \(\hat r\) edges such that if the edges of \(F\) are two-colored, then there will be a copy of \(G\) in the first color or a copy of \(H\) in the second color. Using probabilistic techniques the authors verify the lower bound \(\hat r(K_{n,n},K_{n,n})>n^22^n/60\) for the size Ramsey number for complete bipartite graphs. This corresponds to the upper bound of \(\hat r<{3\over 2}n^32^n\) proved in \textit{P. Erdős}, \textit{R. Faudree}, \textit{C. C. Rousseau} and \textit{R. H. Schelp} [Period. Math. Hung. 9, 145- 161 (1978; Zbl 0331.05122)].