Course Description
Basic principles of counting: addition and multiplication principles, generating functions, recursive methods, inclusion-exclusion, pigeonhole principle; basic concepts of graph theory: graphs, digraphs, connectedness, trees; additional topics from:Polya theory of counting, Ramsey theory; combinatorial optimization - matching and covering, minimum spanning trees, minimum distance, maximum flow; sieves; mobius inversion; partitions; Gaussian numbers and q-analogues; bijections and involutions; partially ordered sets.
Spring 2026
Instructors
Meeting Patterns
Classes Start:
January 12, 2026
Classes End:
April 28, 2026
Location:
00113 Ricks Hall
Class Days:
T H
Class Start Time:
10:15am
Class End Time:
11:30am
Class Type:
Lecture
Credits:
3.00
Restrictions:
Prerequisite: Grade of C or better in either MA 225 or CSC 226 Computer Science Majors