Degree Reduction in Max Cut and Vertex Cover
This is a counterexample.

Suppose you have this graph:



The maximum cut in this graph has four edges. If you follow the procedure used for vertex cover you get this cut:



In the image, the maximum cut has seven edges.