We have an undirected graph, with a weight function and a minimum cut. If you raise the weights of all the edges by one, the minimum cut remains minimal even with the new weights.
I know this is refutation, but I could not find a good example of refutation. I would be happy if you would help me.