  We prove new lower bounds on the likely size of a maximum independent set in
a random graph with a given average degree. Our method is a weighted version of
the second moment method, where we give each independent set a weight based on
the total degree of its vertices.
