Three early problems on size Ramsey numbers

The size Ramsey number of a graph $H$ is defined as the minimum number of edges in a graph $G$ such that there is a monochromatic copy of $H$ in every two-coloring of $E(G)$. The size Ramsey number was introduced by Erd\H{o}s, Faudree, Rousseau, and Schelp in 1978 and they ended their foundational paper by asking whether one can determine up to a constant factor the size Ramsey numbers of three families of graphs: complete bipartite graphs, book graphs, and starburst graphs. In this paper, we completely resolve the latter two questions and make substantial progress on the first by determining the size Ramsey number of $K_{s,t}$ up to a constant factor for all $t =\Omega(s\log s)$.