Combinatorial Mathematics

Catalog description

Prerequisite: Grade of “C” or better in MTH 220 and a grade of “C” or better in a 300-level mathematics course or departmental approval. A study of combinatorial methods for enumeration, analysis and optimization of discrete structures, such as arrangements, partially ordered sets, graphs, and polytopes. The methods include binomial coefficients and other combinatorial functions, recurrence relations, and generating functions.