MATH 315 : Combinatorics
Explores various topics in enumerative combinatorics including combinations, permutations, multisets, the pigeonhole principle, partial orders, Pascal’s triangle, binomial and multinomial theorems, the inclusion-exclusion principle, derangements, generating functions, recurrence relations, Catalan numbers, Stirling numbers, partition numbers, some basic graph theory, and more as time allows.