We consider graphs G = (V, E) with order p = |V|, size e = |E| and stability number ₀. We collect or determine upper and lower bounds on each of these parameters expressed as functions of the two others. We prove that all these bounds are sharp.