We consider the MINGREEDY strategy for Maximum Cardinality Matching. MINGREEDY repeatedly selects an edge incident with a node of minimum degree. For graphs of degree at most $Δ$ we show that MINGREEDY achieves approximation ratio at least $ \frac{Δ-1}{2Δ-3} $ in the worst case and that this performance is optimal among adaptive priority algorithms in the vertex model, which include many prominent greedy matching heuristics. Even when considering expected approximation ratios of randomized greedy strategies, no better worst case bounds are known for graphs of small degrees.