Over the course of the semester, we discuss theorems and conjectures about graphs with certain induced subgraphs forbidden. Among others, we cover the following topics: perfect graphs, claw-free graphs, algorithms for detecting induced subgraphs, and the Erdo-Hajnal Conjecture.