MATH5505 Combinatorics

MATH5505 is a Honours and Postgraduate coursework Mathematics course. See the course overview below.

Units of credit: 6

Prerequisites: 24 units of level III mathematics or a degree in a numerate discipline or permission of the Lecturer-in-Charge.

Cycle of offering: Not offered each year

Graduate attributes: The course will enhance your research, inquiry and analytical thinking abilities.

More information: This recent course handout (pdf) contains information about course objectives, assessment, course materials and the syllabus. 

The Online Handbook entry contains information about the course. (The timetable is only up-to-date if the course is being offered this year.)

If you are currently enrolled in MATH5505, you can log into UNSW Moodle for this course.

Course Overview

This course will present beautiful topics from classical combinatorics including but not limited to the Pigeonhole Principle, Ramsey theory, matching theory, Latin squares, graph algorithms, the Inclusion-Exclusion Principle, Polya counting and extremal set theory