MAT 320 Discrete Mathematics

The course will cover various techniques of counting, including permutations, combinations, stars and bars, and the principle of inclusion/exclusion; the theory of sequences, including polynomial fitting, solving recurrence relations, and generating functions; and several topics in graph theory, including connectivity, trees, planar graphs, edge and vertex coloring, Ramsey theory, Euler and Hamilton paths, and matchings. Prerequisite(s): MAT 146 . 3 hour(s).