A note on the largest induced matching in graphs avoiding a fixed bipartite graph

We give a simple proof that every $n$-vertex graph $d$-regular graph that does not contain a fixed bipartite graph as a subgraph has an induced matching of size $\mathrm{\Omega }((n\mathrm{/}d)(\log d))$.