MATH429-21S1 (C) Semester One 2021


15 points

Start Date: Monday, 22 February 2021
End Date: Sunday, 27 June 2021
Withdrawal Dates
Last Day to withdraw from this course:
  • Without financial penalty (full fee refund): Sunday, 7 March 2021
  • Without academic penalty (including no fee refund): Friday, 14 May 2021



Matroids (combinatorial geometries) are precisely the geometric structures that underlie the solution of many combinatorial optimisation problems. These problems include scheduling and timetabling, and finding the minimum cost of a communications network between cities. Given this, it is surprising that matroid theory also unifies the notions of linear independence in linear algebra and forests in graph theory as well as the notions of duality for graphs and codes. This course is an introduction to matroid theory and is designed for mathematics and computer science students.

Definition and three fundamental examples; circuits, bases, and uniform matroids; the Greedy Algorithm; geometric representations; the rank function; matroid representation; the closure operator; duality; minors; excluded-minor theorems; the Tutte polynomial.


Subject to approval of the Head of School.

Timetable 2021

Students must attend one activity from each section.

Lecture A
Activity Day Time Location Weeks
01 Tuesday 14:00 - 15:00 Jack Erskine 505
22 Feb - 4 Apr
26 Apr - 6 Jun
Lecture B
Activity Day Time Location Weeks
01 Friday 10:00 - 11:00 Jack Erskine 505
22 Feb - 28 Mar
26 Apr - 6 Jun
Lecture C
Activity Day Time Location Weeks
01 Monday 12:00 - 13:00 Jack Erskine 505
22 Feb - 4 Apr
3 May - 6 Jun

Course Coordinator / Lecturer

Charles Semple

Indicative Fees

Domestic fee $1,000.00

* All fees are inclusive of NZ GST or any equivalent overseas tax, and do not include any programme level discount or additional course-related expenses.

For further information see Mathematics and Statistics .

All MATH429 Occurrences

  • MATH429-21S1 (C) Semester One 2021