Let $r\geq3$ be an integer such that $r-2$ is a prime power and let $H$ be a connected graph on $n$ vertices with average degree at least $d$ and $\alpha(H)\leq\beta n$, where $0<\beta<1$ is a constant. We prove that the size Ramsey number \[ \hat{R}({H};r) > \frac{{nd}}{2}{(r - 2)^2} - C\sqrt n \] for all sufficiently large $n$, where $C$ is a constant depending only on $r$ and $d$... (read more)

PDF Abstract- COMBINATORICS