Abstract: Combinatorics has come to mean a lot of things, most of which can be summarized as the study of finite structures. In this talk, we will look at problems that involve counting objects, or enumerative combinatorics. One can approach these in a plethora of ways, but one that is especially fun and important is to come up with bijective proofs where you transfer one counting problem that seems "difficult" to another "easier" one by putting the two sets into exact correspondence.