The purpose of this chapter is to bring together several beautiful techniques for analyzing independent sets in graphs. Specifically, how large of an independent set must a triangle-free graph contain? How many independent sets can there be in a \(d\)-regular graph with \(n\) vertices? Also, at the end of the chapter, we will look at a nice connection between independent sets in graphs and questions about communicating over a noisy channel originating in information theory.