Skip to content

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 program 5659 or 8161 or 8719 or 8750 or 7659

Delivery

In-person - Standard (usually weekly or fortnightly)

Please note that the above delivery information is an indication on how this course may be delivered within the year.  Delivery mode(s) for each term can be viewed on other sources such as myUNSW and class timetable site.

This Handbook is a comprehensive catalogue of our offerings and includes courses that can be taken to satisfy program requirements irrespective as to their availability for a particular year. Availability of courses is best checked using filters on this site or on the class timetable site.

Pre-2019 Handbook Editions

Access past handbook editions (2018 and prior)
Pre-2019 Handbook Editions