A note on the largest induced matching in graphs without short cycles

We show that every $n$-vertex, $d$-regular graph of girth at least $5$ contains an induced matching of size at least $\Omega((n/d)(\log d / \log \log d))$.