Acyclic matchings in graphs of bounded maximum degree

Julien Baste, Maximilian Fürst, Dieter Rautenbach

A matching $M$ in a graph $G$ is acyclic if the subgraph of $G$ induced by the set of vertices that are incident to an edge in $M$ is a forest. We prove that every graph with $n$ v…