MATH 6570 - Combinatorics

An introductory course in combinatorics. Topics include fundamental counting methods, Pigeonhole Principle, binomial coefficients, inclusion-exclusion principle, Twelvefold way, recurrence relations, generating functions. Advanced topics to be selected from Polya theory, combinatorial design, permutation statistics, Ramsey theory.

Prerequisite/Corequisite:
MATH 2800 with C or greater

Hours:
3