Acyclic matching lower bound for graphs of bounded maximum degree

Let $G$ be a graph with no isolated vertices, let $\Delta$ be its maximum degree, let $n(G)$ denote its number of vertices, and let $\nu_{ac}(G)$ denote its acyclic matching number. The maximum-degree acyclic matching conjecture.

$$\nu_{ac}(G) \geq \min\left\{\frac{2n(G)}{\left(\left\lceil\frac{\Delta}{2}\right\rceil+1\right)\left(\left\lfloor\frac{\Delta}{2}\right\rfloor+1\right)},\frac{n(G)}{2\Delta}\right\}.$$

This would extend the paper's acyclic matching lower bounds from subcubic graphs to arbitrary maximum degree. The source gives no resolution status, so the conjecture remains open.