MATH 432 - Combinatorics

Credits: (3)
Prerequisite(s): (MATH 211 or MATH 210) and MATH 214.
A study of combinatorial theory and applications to practical problems. Topics include: graph theory, graphical algorithms, enumeration principles, inclusion-exclusion principle, recurrence relations, and generating functions. Optional topics: Polya counting principle, combinatorial designs, coding, Boolean algebra, and switching functions.