MATH 422

Combinatorial Mathematics

Units: 1.5

Hours: 3-0

Permutations and combinations, generating functions, recurrence relations, inclusion-exclusion principle. Mobius inversion, Polya's enumeration theorem. Ramsey's theorem, systems of distinctive representatives, combinatorial designs, algorithmic aspects of combinatorics.

Prerequisites:

  • MATH 212 or MATH 233C; and
  • MATH 222 and 1.5 units of 300- or 400-level MATH course; or
  • permission of the department.

Undergraduate course in Mathematics offered by the Department of Mathematics and Statistics in the Faculty of Science.

Schedules:
Summer Fall Spring

Note that not all courses are offered in every term. If a course is not offered, the schedule page will alert you that "No classes were found that meet your search criteria."