Combinatorics and Graph Theory

Prerequisite: MATH 3301.

This course explains how to reason and model using enumerative combinatorics and applied graph theory. Combinatorial reasoning underlies all analysis of computer systems. Topics covered include generating functions, set partitions, recurrence relations, inclusion-exclusion, trees, graph connectivity, independence, graph coloring, Hamiltonian and Euler circuits and paths, regular expressions and languages, and finite state automata. Additional Topics may include regular Turing machines, Computational Complexity, and the theory of NP Complete Problems along with other theoretical Computer Science topics including advanced Recursion Theory.

Credit: 3