Let $\hat{R}(G)$ denote the size Ramsey number, the minimal number of edges $m$ such that there is a graph $H$ with $m$ edges that is Ramsey for $G$.If $G$ has $n$ vertices and maximum degree $d$ then prove that$$\hat{R}(G){\ll }_{d}n.$$