For a finite simple graph, . Randomly order its vertices and retain each vertex preceding all its graph neighbours. This gives an independent set with the first expression as its expected value. The second inequality is the Cauchy-Schwarz inequality.
New to topics? Read the docs here!