Combinatorics and discrete mathematics are becoming increasingly important fields of mathematics because of their extensive applications in computer science, statistics, operations research, and engineering. The purpose of this course is to teach students to model, analyze, and solve combinatorial and discrete mathematical problems. Topics include elements of graph theory, the pigeonhole principle, counting methods, generating functions, recurrence relations and their solution, and the inclusion-exclusion formula. Emphasis is on the application of the methods to problem solving.

Course notes: 

This course is the same as 625.417 - Applied Combinatorics and Discrete Mathematics

Course instructor: 
Whisnant

View Course Homepage(s) for this course.