We present a simple single-pass data stream algorithm using $O((\log n)/\varepsilon^2)$ space that returns an $(\alpha + 2)(1 + \varepsilon)$ approximation to the size of the maximum matching in a graph of arboricity $\alpha$.
(Based on a paper by Andrew McGregor and Sofya Vorotnikova from SOSA 2018.)