Percolation in random graphs is studied numerically. The strength of the la
rgest cluster, the mean cluster size and the number of clusters are examine
d and the critical exponents of these quantities are shown to coincide with
the classical values for percolation.