Sharp Bounds on the Order, Size and Stability Number of Graphs


BibTeX reference

We consider graphs G = (V, E) with order p = |V|, size e = |E| and stability number 0. 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.

, 12 pages