MATH 450 - Combinatorics

Units: 3
Counting techniques, partitions of integers, generating functions, Fibonacci numbers, Pigeon Hole Principle, inclusion/exclusion. Introduction to graphs, paths, trees, and graph colorings. Further topics may areas such as Ramsey theory, multinomial coefficients, graph cycles.

Co-requisites: MATH 300 with grade C- or better.
Possible Instructional Methods: On-ground.
Grading: A-F or CR/NC (student choice).
Student Learning Outcomes - Upon successful completion of this course students will be able to:

Apply the definitions, techniques and theorems of combinatorics.
Creatively conjecture and rigorously write, analyze and critique proofs in combinatorics.
Communicate solutions to problems in combinatorics effectively.