A note on a conjecture on maximum matching in almost regular graphs

Mkrtchyan, Petrosyan, and Vardanyan made the following conjecture: Every graph G with Δ ( G ) − δ ( G ) ≤ 1 has a maximum matching whose unsaturated vertices do not have a common neighbor. We disprove this conjecture.