MATH441L - Combinatorics

3 Credit(s)

Liberal Arts
This course introduces the concepts and techniques used When analyzing discrete mathematical structures and relations. The topics covered include counting principles, the Inclusion-Exclusion Principle, recurrence relations, topics from graph theory, and generating functions. As time permits, topics from finite geometry, Ramsey Theory, matroids, or block designs may be investigated.

Offered When: Biennially in the spring upon sufficient student demand.
Prerequisite(s): MATH 310L or by permission of instructor