This talk will give an overview of the core concepts of intersection theory. The subject will be introduced via an extended example of how (co)homological computations can be used to solve enumerative problems. Some (singular) homology would be useful as a prerequisite, but isn't necessary. Speaker(s): Andy Gordon (UM)