Winter 2019 - Martin Pei

Introduction to graph theory: colourings, matchings, connectivity, planarity. Introduction to combinatorial analysis: generating series, recurrence relations, binary strings, plane trees.

Prereqs: (( MATH106 with a grade of at least 70% or MATH136 or MATH146) and ( MATH135 with a grade of at least 60% or MATH145)) or level at least 2A Software Engineering; Honours Mathematics students only.