$k,s,t$ are positive integers such that $k(s+1)>2t$.
prove: if $G$ k-edge-connected graph then removing any $t$ edges from $G$ will yield a graph with at most $s$ connected components.
question from old exam i'm trying to solve .... have no idea where to start . the graph is k-connected so i guess i'm expected to use "Whitney theorem" or "Manger theorem" but i don't see how i can derive something about number of connected components using mentioned theorems and the given inequality
after some thought i think i need to use induction here .