Skip to main content
Courses

MATH-M 353: DISCRETE MATHEMATICS (3 credits)

About

Covers fundamental topics chosen from enumerative combinatorics and graph theory. Possible topics include permutations, combinations, pigeonhole principle, inclusion-exclusion, generating functions, recurrence relations, Pólya theory, spanning trees, Eulerian paths, Ramsey theory, graph coloring, flow problems, Hamiltonian paths and cycles, electrical networks, random graphs.

Resources