MATH429-17S1 (C) Semester One 2017


0.1250 EFTS
20 Feb 2017 - 25 Jun 2017



Matroids (combinatorial geometries) are precisely the 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. 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.

For a full list of Honours courses, please refer to the School of Mathematics and Statistics Honours Booklet Mathematics and Statistics Honours Booklet

Learning Outcomes

University Graduate Attributes

This course will provide students with an opportunity to develop the Graduate Attributes specified below:


Subject to approval of the Head of School.

Timetable 2017

Students must attend one activity from each section.

Lecture A
Activity Day Time Location Weeks
01 Monday 10:00 - 11:00 Erskine 505 20 Feb - 9 Apr
1 May - 4 Jun
Lecture B
Activity Day Time Location Weeks
01 Tuesday 12:00 - 13:00 Erskine 505 20 Feb - 9 Apr
1 May - 4 Jun

Course Coordinator

Charles Semple

Indicative Fees

Domestic fee $932.00

* Fees include New Zealand GST and do not include any programme level discount or additional course related expenses.

For further information see Mathematics and Statistics.

All MATH429 Occurrences

  • MATH429-17S1 (C) Semester One 2017