Independent set size of a large girth graphs
Bollobas showed that for any $d$ and any $g$, there exists a $d$-regular graph $G$ of girth at least $g$ such that 

$$
\alpha(G) &lt; \frac{2n\log d}{d}.
$$

So you cannot hope for more than a factor 16 improvement. McKay gave somewhat sharper bounds.