Question 32
The degree of each vertex in a graph $G$ does not exceed $100$. We remove edges of this graph. In one step we can remove an arbitrary set of edges without common endpoints which is maximal (in a sense that if we add to this set any of remaining edges, then there will appear two edges with common endpoint). Prove that all the edges will be removed after at most $199$ steps.