M353 | 25836 | Katz, N

Discrete Mathematics (3 cr.) P: MATH M212 or permission of instructor. 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.