MATH 325 Combinatorics

An introduction to the techniques and theory of enumeration of finite sets. Topics include combinations, permutations, generating functions, recurrence relations, the inclusion-exclusion principle, block designs, and graph theory.

Prerequisite

MATH 263, or permission of instructor; reading and writing proofs will be a significant part of the course, so MATH 290 could be useful, though it is not a prerequisite

Offered

Fall semester of odd-numbered years

Instructor

Staff