I know that in a Graph $G$ Containing $n$ vertices and $k$ edges,$G$ will contain atleast $n-k$ components.
Graph containing $n$ vertices and $0$ edges will contain $n$ components.Each time adding an edge will reduce the component by 1.Thus $k$ edge will contain $n-k$ component. This is the minimum number.
I am interested in finding the maximum number of component.please help me out !!!