A Additional background about cutting planes

The black dotted lines are the cut. We prove this by induction. Suppose now that the claim holds for s. Its degree is at most s. Since the state transitions are deterministic functions of the algorithm's actions, We will prove the claim by induction on the step of B&C.