MATH 350 — Honours Discrete Mathematics

Discrete mathematics. Graph Theory: matching theory, connectivity, planarity, and colouring; graph minors and extremal graph theory. Combinatorics: combinatorial methods, enumerative and algebraic combinatorics, discrete probability.

• Rating: 3.51 out of 5 from 117 student reviews
• Difficulty: 4.01 out of 5
• Credits: 3
• Faculty: Faculty of Science
• Department: Mathematics and Statistics
• Taught by: Sergey Norin
• Prerequisites: (MATH 235 or MATH 240 or MATH 245) and (MATH 223 or MATH 236 or MATH 247 or MATH 251).

Sections offered

• Section 001 (Lec), Mon Wed 8:35-9:55 am — 7 seats open