Go to Main Content

Minerva

 

HELP | EXIT

Detailed Course Catalog Information

 

Fall 2017
Nov 21, 2017
Transparent Image
MATH 550 - Combinatorics.
Enumerative combinatorics: inclusion-exclusion, generating functions, partitions, lattices and Moebius inversion. Extremal combinatorics: Ramsey theory, Turan's theorem, Dilworth's theorem and extremal set theory. Graph theory: planarity and colouring. Applications of combinatorics.

Taught in alternate years
Intended primarily for honours and graduate students in mathematics.
Restriction: Permission of instructor.

4.000 Credit hours

Schedule Types: Lecture, Final Exam

Faculty of Science
Mathematics and Statistics Department

Restrictions:
May not be enrolled in one of the following Faculties:     
      Faculty of Dentistry
      Faculty of Medicine
      School of Continuing Studies

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.5.4