Greedy algorithm by selecting vertices with least number of edges for maximum matching?

Question

I\'m learning Blossom Algorithm, but I am confused why you can\'t simply do this greedy approach that I thought of. Does anyone have a counterexample?

While n