MATH 420 Introduction to Combinatorics

3 Credit(s)

This course is an introduction to combinatorics: a branch of mathematics that studies the existence, enumeration, analysis, and optimization of discrete structures that satisfy certain properties. Topics include counting distributions and colorings, sieve methods (such as inclusion-exclusion, for example), generating functions, partially ordered sets, and Ramsey theory. Additional topics may be included, such as permutation spaces, matching theory, and elementary graph theory.

Enrollment Requirements:
Prerequisites: MATH 141 and 260 or permission of instructor