MAT 375 - Combinatorics

Techniques for counting configurations of objects. Recurrence relations; principle of inclusion-exclusion; graphs, trees, and circuits. Additional topics chosen from Polya’s Theorem, generating functions, and network flows.

Credit Hours: 3

Prerequisite Courses: MAT 275 or CSC 133
Course Repeatability: Course may not be repeated.