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