CSC 416 - Introduction to Combinatorics

Catalog 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.

Contact Hours: Prerequisites: Grade of C or better in either MA225 or CSC226
Co-requisites: None
Restrictions: None
Textbook: Combinatorics

Course Outcomes:
Students will learn...


See Course Listings

See Course Coordinators