In a graph with $k$ edges, if we pick every vertex randomly and independently with a probability of $\frac{1}{2}$, prove that the probability that this set of randomly chosen vertices is an independent set is greater than $\frac{1}{2^k}$.
The approach I am using involves considering all possible selections of vertices, and bounding the probability that those selections have an independent set.
Thanks so much!