MATH 318: Combinatorics

Credit Hours

3

Prerequisites

MATH 162

Description

Induction, pigeon-hole principle, permutations, combinations, recurrence relations, generating functions, and inclusion-exclusion principle. Topics drawn from partitions, graph theory, graph coloring, and combinatorial design, Polya's theory, Ramsey's theorem, and optimization problems.