There is a more recent version of this academic item available.

Overview

This course will present beautiful topics from classical combinatorics, including, but not limited to, the Pigeonhole Principle, Ramsey Theory, matching theory, Latin squares, graphs algorithms, the Inclusion-Exclusion Principle, generating functions, and Polya counting. Pre-requisites: 24 units of level III mathematics or a degree in a numerate discipline or permission of … For more content click the Read More button below.

Conditions for Enrolment

Enrolment in a postgraduate coursework mathematics program

Delivery

In-person - Standard (usually weekly or fortnightly)

Course Outline

To access course outline please visit below link (Please note that access to UNSW Canberra course outlines requires VPN):

Pre-2019 Handbook Editions

Access past handbook editions (2018 and prior)