MATH 550 — Combinatorics

Name: MATH 550 — Combinatorics
Rating: 5.0 (1 reviews)

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.

Rating: 5.00 out of 5 from 1 student reviews
Difficulty: 5.00 out of 5
Credits: 4
Faculty: Faculty of Science
Department: Mathematics and Statistics