MATH 422

Combinatorial Mathematics

Units: 1.5

Hours: 3-0-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 2018 Fall 2018 Spring 2019

Summer timetable available: February 15. Fall and Spring timetables available: May 15.

Before these dates the class schedule will show "No classes were found that meet your search criteria". If this message is shown after these dates, the course is not scheduled for the selected term.