Ï㽶ÊÓƵ

MATH 550 Combinatorics (4 credits)

Note: This is the 2011–2012 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.

Offered by: Mathematics and Statistics (Faculty of Science)

Overview

Mathematics & Statistics (Sci) : 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.

Terms: Winter 2012

Instructors: Norin, Sergey (Winter)

  • Intended primarily for honours and graduate students in mathematics.

  • Restriction: Permission of instructor.

Back to top