MATH 379 - Combinatorics

A second course in discrete mathematics that develops more advanced counting techniques. Combinatorics is the study of arrangements, patterns and configurations. Generally speaking, we fix a set of objects and then arrange those objects into patterns satisfying special rules. Once we identify an interesting family of objects, we ask: how many are there? what are their structural properties? how can we find the “best” one(s)? Topics are drawn from graph theory, enumerative combinatorics, graph algorithms, and generating functions. Prerequisite(s): MATH 279 and MATH 237 Offered odd-numbered fall semesters. (4 Credits)